Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
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
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Journal of Functional Programming
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
Barendregt's Variable Convention in Rule Inductions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Formalising the π-calculus using nominal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Quotients revisited for Isabelle/HOL
Proceedings of the 2011 ACM Symposium on Applied Computing
General bindings and alpha-equivalence in nominal Isabelle
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A Canonical Locally Named Representation of Binding
Journal of Automated Reasoning
Hi-index | 0.00 |
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied pi-calculus and the concurrent constraint pi-calculus. We have formalised psi-calculi in the interactive theorem prover Isabelle using its nominal datatype package. One distinctive feature is that the framework needs to treat binding sequences, as opposed to single binders, in an efficient way. While different methods for formalising single binder calculi have been proposed over the last decades, representations for such binding sequences are not very well explored. The main effort in the formalisation is to keep the machine checked proofs as close to their pen-and-paper counterparts as possible. We discuss two approaches to reasoning about binding sequences along with their strengths and weaknesses. We also cover custom induction rules to remove the bulk of manual alpha-conversions.