Formalising the π-calculus using nominal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4423 LNCS, Issue , 2007, Pages 63-77

  Bengtson, Jesper ^a   Parrow, Joachim ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; SEMANTICS; THEOREM PROVING;

DATATYPE PACKAGES; FORMAL PROOFS; NOMINAL LOGIC; PI-CALCULUS;

FORMAL LOGIC;

EID: 35148896647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_6     Document Type: Conference Paper

References (21)

1. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, Nathan J. Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The POPLmark challenge. In International Conference on Theorem Proving in Higher Order Logics (TPHOLs), August 2005.
2. Jesper Bengtson. Generic implementations of process calculi in Isabelle. In The 16th Nordic Workshop on Programming Theory (NWPT'04), pages 74-78, 2004.
3. M. J. Gabbay. A theory of inductive definitions with a-equivalence, PhD thesis, University of Cambridge, 2000.
4. M. J. Gabbay. The π-calculus in FM. In Fairouz Kamareddine, editor, Thirty-five years of Automath. Kluwer, 2003.
5. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
6. Furio Honsell, Marino Miculan, and Ivan Scagnetto. π-calculus in (co)inductive type theory. Theoretical Computer Science, 253(2):239-285, 2001.
7. Thomas F. Melham. A mechanized theory of the pi-calculus in HOL. Nordic Journal of Computing, 1(1):50-76, 1994.
8. R. Milner. A Calculus of Communicating Systems. Number 92 in LNCS. Springer-Verlag, 1980.
9. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I/II. Inf. Comput., 100(1):1-77, 1992.
10. Otmane Aït Mohamed. Mechanizing a pi-calculus equivalence in HOL. In Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications, pages 1-16, London, UK, 1995. Springer-Verlag.
11. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: a proof assistant for higher-order logic. Springer-Verlag, 2002.
12. Joachim Parrow. An introduction to the pi-calculus. In Handbook of Process Algebra, pages 479-543. Elsevier, 2001.
13. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
14. A. M. Pitts. Alpha-structural recursion and induction. Journal of the ACM, 53:459-506, 2006.
15. Christine Röckl and Daniel Hirschkoff. A fully adequate shallow embedding of the 7T-calculus in Isabelle/HOL with mechanized syntax analysis. J. Funct. Program., 13(2):415-451, 2003.
16. C. Urban and S. Berghoffer. A recursion combinator for nominal datatypes implemented in Isabelle/HOL, Accepted to IJCAR 2006.
17. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323:473-497, 2004.
18. Christian Urban and Michael Norrish. A formal treatment of the barendregt variable convention in rule inductions. In MERLIN '05: Proceedings of the 3rd A CM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, pages 25-32, New York, NY, USA, 2005. ACM Press.
19. Christian Urban and Christine Tasson. Nominal techniques in Isabelle/HOL. In CADE, pages 38-53, 2005.
20. Björn Victor and Faxon Moller. The Mobility Workbench -a tool for the itcalculus. In David Dill, editor, CAV'94: Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 428-440. Springer-Verlag, 1994.
21. Markus Wenzel. Isar - a generic interpretative approach to readable formal proof documents. In Theorem Proving in Higher Order Logics, pages 167-184, 1999.