{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"thinker-robin-milner","title":"Robin Milner — Types, Processes, and the Pi Calculus","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Thinkers](https://miscsubjects.com/a/oip-thinkers) › **Robin Milner — Types, Processes, and the Pi Calculus**\n>\n> **Shelf:** Thinkers · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# Robin Milner — Types, Processes, and the Pi Calculus\n\n## §SELF — thinker-robin-milner\n\n**What this page is:** a profile of Robin Milner and his three major contributions to computer science\n**What it explains:** the ML programming language, CCS, and the pi calculus, and how the pi calculus models the OIP protocol\n**Why read it:** to understand the formal foundations of process communication and how they apply to capability-passing systems\n\n### Who Robin Milner Was\n\nRobin Milner (1934–2010) was a British computer scientist. He received the Turing Award in 1991 \"for three distinct and complete achievements: LCF (Logic for Computable Functions), ML (MetaLanguage), and CCS (Calculus of Communicating Systems), and for his leading role in the formulation of the pi calculus.\" He held positions at the University of Edinburgh, the University of Cambridge, and the University of Edinburgh again, where he founded the Laboratory for Foundations of Computer Science.\n\n### Why His Work Matters\n\nMilner's work created formal tools for reasoning about programs that communicate. Before Milner, there was no rigorous way to describe what happens when two programs send messages to each other. After Milner, there was. His calculi are used today in the design of programming languages, network protocols, and distributed systems.\n\n### The Three Contributions\n\n**1. ML — MetaLanguage (1973)**\n\nML is a programming language with a powerful static type system and type inference. Type inference means the compiler deduces the types of variables and expressions automatically; the programmer does not need to write type annotations. The key idea of ML's type system: well-typed programs cannot go wrong. \"Go wrong\" means a specific thing here — it means the program cannot perform an operation on data of the wrong type (such as adding a string to an integer). These errors are caught at compile time, before the program runs.\n\nML also introduced parametric polymorphism (the ability to write functions that work on any type) and pattern matching. These features are now standard in languages such as Haskell, Rust, OCaml, and Scala.\n\n**2. CCS — Calculus of Communicating Systems (1980)**\n\nCCS is a formal language for describing concurrent processes that communicate with each other. A process in CCS can perform actions, compose with other processes, and communicate over named channels. CCS provides a way to write a specification of a communicating system and prove that an implementation matches it.\n\nThe key concept in CCS is the bisimulation: a mathematical relation between two processes that means they behave identically from the outside. If two processes are bisimilar, no observer can tell them apart by watching their actions.\n\n**3. The Pi Calculus (1992)**\n\nThe pi calculus is an extension of CCS where processes can create new communication channels and pass them to other processes. This is called \"mobility\" — the communication topology (which process can talk to which) can change at runtime. A process can hand a channel to another process, and that process can then use the channel to communicate with a third process.\n\nThe pi calculus has two key operations:\n- **Channel creation:** A process creates a new, private channel.\n- **Channel passing:** A process sends a channel name to another process over an existing channel.\n\nThese two operations make the pi calculus expressive enough to model dynamic network topologies, mobile agents, and object migration.\n\n### The Connection to OIP\n\nThe pi calculus models exactly what OIP (Object Interaction Protocol) does. The correspondence is direct:\n\n- An OIP **object** is a pi calculus **process** — it has state and can receive messages.\n- An OIP **capability token** is a pi calculus **communication channel** — it is the path by which a process is reached.\n- **Passing a token** to another model is **passing a channel** in the pi calculus — the receiving model (process) can now communicate with the object.\n- The pi calculus **scope extrusion** rule matches OIP **delegation** — when a model passes a capability to another model, the scope of that capability extends to the receiver.\n\nThe pi calculus provides a formal proof that this model of communication is sound. The type systems and process equivalences developed by Milner can be applied to OIP to verify that a sequence of model-operated actions produces the correct result.\n\n### What They Got Right\n\n- **Type safety:** ML proved that a practical programming language can have a sound type system that catches real errors. The \"well-typed programs cannot go wrong\" slogan is not a metaphor — it is a mathematical theorem.\n- **Process algebra:** CCS showed that concurrent communication can be formalized and reasoned about with the same rigor as sequential computation.\n- **Mobility:** The pi calculus showed that process communication and channel passing are sufficient to model any form of concurrent computation. The pi calculus is Turing-complete.\n- **Compositionality:** All of Milner's work emphasizes that systems should be built from composable parts, and that the behavior of a composite system should be derivable from the behavior of its parts.\n\n### What They Got Wrong or Left Unfinished\n\n- **The pi calculus does not handle failure.** There is no built-in notion of a failed process or a dropped message. Extensions (such as the stochastic pi calculus and the spi calculus) add these, but the original does not.\n- **No quantitative reasoning.** CCS and the pi calculus reason about what can happen, not how long it takes or with what probability. Real systems have timing and failure rates, and Milner's calculi do not capture these.\n- **Verification is hard.** Checking whether two processes are bisimilar is computationally expensive. For large systems, automated verification remains a research problem.\n- **ML's type system is not complete.** The type inference algorithm (algorithm W) accepts some programs that are safe but rejects others that are also safe. The type system is conservative — it prefers to reject a safe program than accept an unsafe one.\n\n### How It Connects to Other Ideas\n\n**Model-operated work:** The pi calculus is the formal foundation for model-operated work. When a model receives a capability token and uses it to invoke an object, the pi calculus describes exactly what happens in terms of process communication. The receipt produced by the invocation is a trace element in the calculus.\n\n**Capability-based security:** Milner's channel-passing mechanism is a form of capability passing. A channel in the pi calculus is an unforgeable token that grants the right to communicate. This is the same principle as OIP capability tokens.\n\n**CSP (Communicating Sequential Processes):** CSP is another process algebra, developed by Tony Hoare independently of Milner's CCS. CSP and CCS have different primitives (CSP uses events, CCS uses actions) but both model concurrent communication. They are often compared and combined.\n\n### Sources\n\n- \"A Theory of Type Polymorphism in Programming\" (1978) — the formal foundation of ML's type system\n- \"Communication and Concurrency\" (1989) — the definitive book on CCS\n- \"The Polyadic Pi-Calculus\" (1992) — Milner's introduction of the pi calculus with multiple arguments per communication\n- \"The Definition of Standard ML\" (1990, with Mads Tofte and Robert Harper) — the formal specification of the ML language\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Thinkers shelf](https://miscsubjects.com/a/oip-thinkers) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [Alan Kay — The Big Idea Is Messaging](https://miscsubjects.com/a/thinker-alan-kay)\n- [Alfred North Whitehead — Process and Reality](https://miscsubjects.com/a/thinker-alfred-north-whitehead)\n- [J.L. Austin and John Searle — Speech Acts](https://miscsubjects.com/a/thinker-austin-searle)\n- [Barbara Liskov — Abstract Data Types and Distributed Consensus](https://miscsubjects.com/a/thinker-barbara-liskov)\n- [Bram Cohen — BitTorrent and Content-Addressed Protocol Design](https://miscsubjects.com/a/thinker-bram-cohen)\n- [Butler Lampson — Protection and Access Control](https://miscsubjects.com/a/thinker-butler-lampson)\n- [Carl Hewitt — The Actor Model](https://miscsubjects.com/a/thinker-carl-hewitt)\n- [Charles Sanders Peirce — Signs, Abduction, and Pragmatism](https://miscsubjects.com/a/thinker-charles-peirce)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/thinker-robin-milner`\n- JSON article: `https://miscsubjects.com/api/articles/thinker-robin-milner`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=Robin%20Milner%20%E2%80%94%20Types%2C%20Processes%2C%20and%20the%20Pi%20Calculus`\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-robin-milner"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/thinker-robin-milner/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Thinkers (oip-thinkers). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":33,"label":"Thinkers on shelf"}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:45.138Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"01e2f6db3fa0199b45b7befc3e20692c581a267cd0cb6bcda324dbb4dc86a8f8"},{"ts":"2026-07-17T02:42:57.783Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-robin-milner","response":"42 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"01e2f6db3fa0199b45b7befc3e20692c581a267cd0cb6bcda324dbb4dc86a8f8","hash":"2c047b7d0691448f4b02d7ada8eccf47262c20a62a2d6092bdc897c7c4c01b38"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"owner":1},"head":"2c047b7d0691448f4b02d7ada8eccf47262c20a62a2d6092bdc897c7c4c01b38"},"posted_at":"2026-07-15T04:20:45.138Z","created_at":"2026-07-15T04:20:45.138Z","updated_at":"2026-07-17T02:42:57.783Z","machine":{"shape":"article.machine/v1","slug":"thinker-robin-milner","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-robin-milner","json":"https://miscsubjects.com/api/articles/thinker-robin-milner","bundle":"https://miscsubjects.com/api/articles/thinker-robin-milner/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-robin-milner/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-robin-milner","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-robin-milner\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-robin-milner\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-robin-milner/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-robin-milner\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-robin-milner | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-robin-milner","json":"/api/articles/thinker-robin-milner","markdown":"/api/articles/thinker-robin-milner/bundle?format=markdown","skill":"/api/articles/thinker-robin-milner/skill","topology":"/api/articles/thinker-robin-milner/topology","versions":"/api/articles/thinker-robin-milner/revisions","invocations":"/api/articles/thinker-robin-milner/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-robin-milner","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"15240663bcc5b96948839ce6e375b98f042c6d55fd5e7e06054283a62739a214","object":{"object_type":"article-object","identity":{"id":"article:thinker-robin-milner","slug":"thinker-robin-milner","title":"Robin Milner — Types, Processes, and the Pi Calculus"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/thinker-robin-milner","role":"explain","audience":"human"},"skill":{"route":"/api/articles/thinker-robin-milner/skill","role":"direct behavior","audience":"model","content":"---\nname: thinker-robin-milner\ndescription: Apply the Robin Milner — Types, Processes, and the Pi Calculus article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Robin Milner — Types, Processes, and the Pi Calculus\n\nThis Skill is the behavioral expression of [the canonical article](/a/thinker-robin-milner). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/thinker-robin-milner.\n- Read claims and relationships at /api/articles/thinker-robin-milner/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\n<!-- hierarchy:nav -- Path: OIP https://miscsubjects.com/a/oip › Thinker Reference https://miscsubjects.com/a/oip-thinker-reference › Thinkers https://miscsubjects.com/a/oip-thinkers › Robin Milner — Types, Processes, and the Pi Calculus Sh\n\n## Representations\n\n- Human: /a/thinker-robin-milner\n- JSON: /api/articles/thinker-robin-milner\n- Relationships: /api/articles/thinker-robin-milner/topology\n- History: /api/articles/thinker-robin-milner/revisions\n"},"json":{"route":"/api/articles/thinker-robin-milner","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/thinker-robin-milner/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-robin-milner","thinker","robin","milner"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/thinker-robin-milner/invocations?status=success","failure_events":"/api/articles/thinker-robin-milner/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"thinker-robin-milner","title":"Robin Milner — Types, Processes, and the Pi Calculus","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Thinkers](https://miscsubjects.com/a/oip-thinkers) › **Robin Milner — Types, Processes, and the Pi Calculus**\n>\n> **Shelf:** Thinkers · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# Robin Milner — Types, Processes, and the Pi Calculus\n\n## §SELF — thinker-robin-milner\n\n**What this page is:** a profile of Robin Milner and his three major contributions to computer science\n**What it explains:** the ML programming language, CCS, and the pi calculus, and how the pi calculus models the OIP protocol\n**Why read it:** to understand the formal foundations of process communication and how they apply to capability-passing systems\n\n### Who Robin Milner Was\n\nRobin Milner (1934–2010) was a British computer scientist. He received the Turing Award in 1991 \"for three distinct and complete achievements: LCF (Logic for Computable Functions), ML (MetaLanguage), and CCS (Calculus of Communicating Systems), and for his leading role in the formulation of the pi calculus.\" He held positions at the University of Edinburgh, the University of Cambridge, and the University of Edinburgh again, where he founded the Laboratory for Foundations of Computer Science.\n\n### Why His Work Matters\n\nMilner's work created formal tools for reasoning about programs that communicate. Before Milner, there was no rigorous way to describe what happens when two programs send messages to each other. After Milner, there was. His calculi are used today in the design of programming languages, network protocols, and distributed systems.\n\n### The Three Contributions\n\n**1. ML — MetaLanguage (1973)**\n\nML is a programming language with a powerful static type system and type inference. Type inference means the compiler deduces the types of variables and expressions automatically; the programmer does not need to write type annotations. The key idea of ML's type system: well-typed programs cannot go wrong. \"Go wrong\" means a specific thing here — it means the program cannot perform an operation on data of the wrong type (such as adding a string to an integer). These errors are caught at compile time, before the program runs.\n\nML also introduced parametric polymorphism (the ability to write functions that work on any type) and pattern matching. These features are now standard in languages such as Haskell, Rust, OCaml, and Scala.\n\n**2. CCS — Calculus of Communicating Systems (1980)**\n\nCCS is a formal language for describing concurrent processes that communicate with each other. A process in CCS can perform actions, compose with other processes, and communicate over named channels. CCS provides a way to write a specification of a communicating system and prove that an implementation matches it.\n\nThe key concept in CCS is the bisimulation: a mathematical relation between two processes that means they behave identically from the outside. If two processes are bisimilar, no observer can tell them apart by watching their actions.\n\n**3. The Pi Calculus (1992)**\n\nThe pi calculus is an extension of CCS where processes can create new communication channels and pass them to other processes. This is called \"mobility\" — the communication topology (which process can talk to which) can change at runtime. A process can hand a channel to another process, and that process can then use the channel to communicate with a third process.\n\nThe pi calculus has two key operations:\n- **Channel creation:** A process creates a new, private channel.\n- **Channel passing:** A process sends a channel name to another process over an existing channel.\n\nThese two operations make the pi calculus expressive enough to model dynamic network topologies, mobile agents, and object migration.\n\n### The Connection to OIP\n\nThe pi calculus models exactly what OIP (Object Interaction Protocol) does. The correspondence is direct:\n\n- An OIP **object** is a pi calculus **process** — it has state and can receive messages.\n- An OIP **capability token** is a pi calculus **communication channel** — it is the path by which a process is reached.\n- **Passing a token** to another model is **passing a channel** in the pi calculus — the receiving model (process) can now communicate with the object.\n- The pi calculus **scope extrusion** rule matches OIP **delegation** — when a model passes a capability to another model, the scope of that capability extends to the receiver.\n\nThe pi calculus provides a formal proof that this model of communication is sound. The type systems and process equivalences developed by Milner can be applied to OIP to verify that a sequence of model-operated actions produces the correct result.\n\n### What They Got Right\n\n- **Type safety:** ML proved that a practical programming language can have a sound type system that catches real errors. The \"well-typed programs cannot go wrong\" slogan is not a metaphor — it is a mathematical theorem.\n- **Process algebra:** CCS showed that concurrent communication can be formalized and reasoned about with the same rigor as sequential computation.\n- **Mobility:** The pi calculus showed that process communication and channel passing are sufficient to model any form of concurrent computation. The pi calculus is Turing-complete.\n- **Compositionality:** All of Milner's work emphasizes that systems should be built from composable parts, and that the behavior of a composite system should be derivable from the behavior of its parts.\n\n### What They Got Wrong or Left Unfinished\n\n- **The pi calculus does not handle failure.** There is no built-in notion of a failed process or a dropped message. Extensions (such as the stochastic pi calculus and the spi calculus) add these, but the original does not.\n- **No quantitative reasoning.** CCS and the pi calculus reason about what can happen, not how long it takes or with what probability. Real systems have timing and failure rates, and Milner's calculi do not capture these.\n- **Verification is hard.** Checking whether two processes are bisimilar is computationally expensive. For large systems, automated verification remains a research problem.\n- **ML's type system is not complete.** The type inference algorithm (algorithm W) accepts some programs that are safe but rejects others that are also safe. The type system is conservative — it prefers to reject a safe program than accept an unsafe one.\n\n### How It Connects to Other Ideas\n\n**Model-operated work:** The pi calculus is the formal foundation for model-operated work. When a model receives a capability token and uses it to invoke an object, the pi calculus describes exactly what happens in terms of process communication. The receipt produced by the invocation is a trace element in the calculus.\n\n**Capability-based security:** Milner's channel-passing mechanism is a form of capability passing. A channel in the pi calculus is an unforgeable token that grants the right to communicate. This is the same principle as OIP capability tokens.\n\n**CSP (Communicating Sequential Processes):** CSP is another process algebra, developed by Tony Hoare independently of Milner's CCS. CSP and CCS have different primitives (CSP uses events, CCS uses actions) but both model concurrent communication. They are often compared and combined.\n\n### Sources\n\n- \"A Theory of Type Polymorphism in Programming\" (1978) — the formal foundation of ML's type system\n- \"Communication and Concurrency\" (1989) — the definitive book on CCS\n- \"The Polyadic Pi-Calculus\" (1992) — Milner's introduction of the pi calculus with multiple arguments per communication\n- \"The Definition of Standard ML\" (1990, with Mads Tofte and Robert Harper) — the formal specification of the ML language\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Thinkers shelf](https://miscsubjects.com/a/oip-thinkers) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [Alan Kay — The Big Idea Is Messaging](https://miscsubjects.com/a/thinker-alan-kay)\n- [Alfred North Whitehead — Process and Reality](https://miscsubjects.com/a/thinker-alfred-north-whitehead)\n- [J.L. Austin and John Searle — Speech Acts](https://miscsubjects.com/a/thinker-austin-searle)\n- [Barbara Liskov — Abstract Data Types and Distributed Consensus](https://miscsubjects.com/a/thinker-barbara-liskov)\n- [Bram Cohen — BitTorrent and Content-Addressed Protocol Design](https://miscsubjects.com/a/thinker-bram-cohen)\n- [Butler Lampson — Protection and Access Control](https://miscsubjects.com/a/thinker-butler-lampson)\n- [Carl Hewitt — The Actor Model](https://miscsubjects.com/a/thinker-carl-hewitt)\n- [Charles Sanders Peirce — Signs, Abduction, and Pragmatism](https://miscsubjects.com/a/thinker-charles-peirce)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/thinker-robin-milner`\n- JSON article: `https://miscsubjects.com/api/articles/thinker-robin-milner`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=Robin%20Milner%20%E2%80%94%20Types%2C%20Processes%2C%20and%20the%20Pi%20Calculus`\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-robin-milner"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/thinker-robin-milner/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Thinkers (oip-thinkers). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":33,"label":"Thinkers on shelf"}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:45.138Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"01e2f6db3fa0199b45b7befc3e20692c581a267cd0cb6bcda324dbb4dc86a8f8"},{"ts":"2026-07-17T02:42:57.783Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-robin-milner","response":"42 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"01e2f6db3fa0199b45b7befc3e20692c581a267cd0cb6bcda324dbb4dc86a8f8","hash":"2c047b7d0691448f4b02d7ada8eccf47262c20a62a2d6092bdc897c7c4c01b38"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"owner":1},"head":"2c047b7d0691448f4b02d7ada8eccf47262c20a62a2d6092bdc897c7c4c01b38"},"posted_at":"2026-07-15T04:20:45.138Z","created_at":"2026-07-15T04:20:45.138Z","updated_at":"2026-07-17T02:42:57.783Z","machine":{"shape":"article.machine/v1","slug":"thinker-robin-milner","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-robin-milner","json":"https://miscsubjects.com/api/articles/thinker-robin-milner","bundle":"https://miscsubjects.com/api/articles/thinker-robin-milner/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-robin-milner/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-robin-milner","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-robin-milner\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-robin-milner\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-robin-milner/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-robin-milner\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-robin-milner | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-robin-milner","json":"/api/articles/thinker-robin-milner","markdown":"/api/articles/thinker-robin-milner/bundle?format=markdown","skill":"/api/articles/thinker-robin-milner/skill","topology":"/api/articles/thinker-robin-milner/topology","versions":"/api/articles/thinker-robin-milner/revisions","invocations":"/api/articles/thinker-robin-milner/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-robin-milner","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"15240663bcc5b96948839ce6e375b98f042c6d55fd5e7e06054283a62739a214"}}}