Higher-order abstract syntax with induction in isabelle/HOL: Formalizing the π-calculus and mechanizing the theory of contexts

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

Volumn 2030, Issue , 2001, Pages 364-378

  Röckl, Christine ^a   Hirschkoff, Daniel ^b   Berghofer, Stefan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINDERS; MACHINERY; SYNTACTICS; THEOREM PROVING;

ALPHA-CONVERSION; HIGHER-ORDER ABSTRACT SYNTAX; INDUCTION PRINCIPLES; ISABELLE/HOL; META LEVELS; STRUCTURAL INDUCTION; SYNTAX ANALYSIS; THEORY OF CONTEXTS;

CALCULATIONS;

EID: 84885653712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_24     Document Type: Conference Paper

References (27)

1. O. Ait-Mohamed. Pi-Calculus Theory in HOL. PhD thesis, Henry Poincarre University, Nancy, 1996.
2. S. Berghofer and M. Wenzel. Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering. In Proc. TPHOL'99, volume 1690 of LNCS, pages 19-36, 1999.
3. J. Despeyroux. A higher-order specification of the π-calculus. In Proc. TCS'00, LNCS. Springer, 2000. To appear.
4. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In Proc. TLCA'95, volume 902 of LNCS, pages 124-138. Springer, 1995.
5. J. Despeyroux and A. Hirschowitz. Higher-order abstract syntax with induction in Coq. In Proc. LPAR'94, volume 822 of LNCS, pages 159-173. Springer, 1994.
6. S. Gay. A framework for the formalisation of pi-calculus type-systems in Isabelle/ HOL. Technical report, University of Glasgow, 2000.
7. A. Gordon and T. Melham. Five axioms of alpha-conversion. In Proc. TPHOL'96, volume 1125 of LNCS, pages 173-190. Springer, 1996.
8. L. Henry-Greard. Proof of the subject reduction property for a pi-calculus in Coq. Technical Report RR-3698, INRIA, 1999.
9. D. Hirschkoff. A full formalisation of π-calculus theory in the calculus of constructions. In Proc. TPHOL'97, volume 1275 of LNCS, pages 153-169. Springer, 1997.
10. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Proc. LICS'99, volume 158, pages 204-213. IEEE, 1999.
11. F. Honsell, M. Miculan, and I. Scagnetto. π-calculus in (co)inductive type theory. Theoretical Computer Science, 253(2):239-285, 2001.
12. B. Mammass. Methodes et Outils pour les Preuve Compositionnelles de Systemes Paralleeles (in french). PhD thesis, Pierre et Marie Curie University, Paris, 1999.
13. R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. Transactions on Computational Logic, 2000. to appear.
14. T. Melham. A mechanized theory of the π-calculus in HOL. Nordic Journal of Computing, 1(1):50-76, 1995.
15. D. Miller. Specification of the pi-calculus. available at http://www.cse.psu.edu/~dale/lProlog/examples/pi-calculus/toc.html.
16. R. Milner. Functions as processes. Journal of Math. Struct. in Computer Science, 17:119-141, 1992.
17. R. Milner. Communicating and Mobile Processes. Cambridge University Press, 1999.
18. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1-77, 1992.
19. G. Nadathur and D. Miller. An overview of prolog. In M. Press, editor, Proc. LPC'98, pages 810-827, 1998.
20. L. C. Paulson. Isabelle's object-logics. Technical Report 286, University of Cambridge, Computer Laboratory, 1993.
21. L. C. Paulson. A fixedpoint approach to implementing (co)inductive definitions. In Procs CADE'94, volume 814 of LNAI, pages 148-161. Springer, 1994.
22. L. C. Paulson, editor. Isabelle: a generic theorem prover, volume 828 of LNCS. Springer, 1994.
23. F. Pfenning. Elf: A language for logic definition and verified metaprogramming. In Proc. LICS'89, pages 313-321. IEEE, 1989.
24. F. Pfenning and C. Schurmann. System description: Twelf - a meta-logical framework for deductive systems. In Proc. CAD'99, volume 1632 of LNAI, pages 202-206. Springer, 1999.
25. C. Rockl. On the Mechanized Validation of Infinite- State and Parameterized Reactive and Mobile Systems. PhD thesis, Technische Universit¨at M¨unchen, 2001. Submitted.
26. C. Rockl and D. Sangiorgi. A π-calculus process semantics of concurrent idealised ALGOL. In Proc. FOSSACS'99, volume 1578 of LNCS, pages 306-321. Springer, 1999.
27. D. Walker. Objects in the π-calculus. Information and Computation, 116:253-271, 1995.