Information and Computation - Semantics of Data Types
A calculus of mobile processes, II
Information and Computation
The π-calculus in direct style
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
A Modal Lambda Calculus with Iteration and Case Constructs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Formalization of a Concurrent Object Calculus up to alpha-Conversion
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A Logic for Reasoning with Higher-Order Abstract Syntax
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Two-Level Meta-reasoning in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We present a formalization of a typed π-calculus in the Calculus of Inductive Constructions. We give the rules for type-checking and for evaluation and formalize a proof of type preservation in the Coq system. The encoding of the π-calculus in Coq uses Coq functions to represent bindings of variables. This kind of encoding is called a higher-order specification. It provides a concise description of the calculus, leading to simple proofs. The specification we propose for the pi-calculus formalizes communication by means of function application.