Coding of a typed monadic pi-calculus using parameters for free names. This development contains the specification for a monadic pi-calculus using the same coding method for names than J. Mc Kinna and R. Pollack used for PTS in LEGO: "Some Lambda Calculus and Type Theory Formalized". The basic, monadic calculus encoded here has a type system restraining the direction of communication for processes' names. A number of lemmas usefull for doing proofs on that coding are included, and subject reduction properties for each kind of transition is made as an example of actually using the coding to mechanize proofs on the pi-calculus.

opam install coq-param-pi.8.6.0

- homepage
- https://github.com/coq-contribs/param-pi
- license
- LGPL 2.1
- bugs tracker
- https://github.com/coq-contribs/param-pi/issues
- dependencies
- coq (>= 8.6 & < 8.7~)
- source
- https://github.com/coq-contribs/param-pi/archive/v8.6.0.tar.gz
- package
- https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-param-pi/coq-param-pi.8.6.0