Math 2.0

Computer science Semantics and logic in computer science Concept

Pi-calculus

Builds on Process calculusLambda calculus

Summary

The π\pi-calculus is a process calculus in which channel names can themselves be sent along channels. It was introduced by Robin Milner, Joachim Parrow and David Walker as a calculus of mobile processes, whose links can change while they run. Its main step is communication: x‾⟨y⟩.P∣x(z).Q\overline{x}\langle y \rangle.P \mid x(z).Q becomes P∣Q[y/z]P \mid Q[y/z], so the receiver learns the name yy and may later use it as a channel. The lambda calculus can be encoded in it, and it is a basic model for concurrent and distributed systems and for session types.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary relation concept
  2. Lambda calculus concept
  3. Operational semantics concept
  4. Process calculus concept
  5. Pi-calculus concept

Further reading

  1. Web https://en.wikipedia.org/wiki/Π-calculus
About this page
TagWHQE2KR445
URIm2://WHQE2KR445
Kindconcept
WritingW0 stub
MSC68Q85, 68Q55
SpecializesProcess calculus
UsesProcess calculus, Lambda calculus
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions