# Binary π-calculus
- published on
Binary π-calculus is a binary encoding of π-calculus. It is to π-calculus as binary lambda calculus is to lambda calculus.
originally on esolangs: https://esolangs.org/wiki/Binary_pi-calculus
Programs are encoded in prefix notation, using the following rules. Here, P & Q represent processes and x & y represent channels (names). _ represents an omitted argument.
000: Nil process (0)001P: Repeatedly spawn copies ofP(!P)010P: Bind name, then executeP((v_)P)011PQ: ExecutePandQin parallel (P|Q)100xyP: Send bound or free nameyover channelx, then executeP(x<y>.P)101xP: Receive and bind name over channelx, then executeP(x(_).P)110n0wherenis zero or more ones: the n-th bound name, where1100is the most recently bound name,11010is the second most recent, and so on111n0wherenis zero or more ones: the free name labeled with n