Developing (meta)theory of λ-calculus in the theory of contexts

Electronic Notes in Theoretical Computer Science

Volumn 58, Issue 1, 2001, Pages 37-58

  Miculan, Marino ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Higher order abstract syntax; Induction; Logical frameworks

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; ENCODING (SYMBOLS); FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING;

HIGHER-ORDER ABSTRACT SYNTAX; INDUCTION; LOGICAL FRAMEWORKS; PERMUTATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19144367233     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00278-6     Document Type: Conference Paper

References (28)

1. Abramsky S., Ong C.-H.L. Full abstraction in the lazy lambda calculus. Information and Computation. 105:1993;159-267
2. Avron A., Honsell F., Mason I.A., Pollack R. Using Typed Lambda Calculus to implement formal systems on a machine. Journal of Automated Reasoning. 9:1992;309-354
3. Barendregt H. "The lambda calculus: its syntax and its semantics," Studies in Logic and the Foundations of Mathematics. 1984;North-Holland
4. Bucalo A., M. Hofmann, F. Honsell, M. Miculan and I. Scagnetto, Consistency of the theory of contexts (2001), submitted.
5. Coquand T. Metamathematical investigations of a calculus of constructions, 31. 1990;91-122 Academic Press
6. Cornes C. and D. Terrasse, Automating inversion of inductive predicates in coq, in: S. Berardi and M. Coppo, editors, Proc. of TYPES'95, number 1158 in Lecture Notes in Computer Science (1995), pp. 85-104.
7. Despeyroux J., A. Felty and A. Hirschowitz, Higher-order syntax in Coq, in: Proc. of TLCA'95, Lecture Notes in Computer Science 905 (1995)
8. also appears as INRIA research report RR-2556, April 1995.
9. Despeyroux J. and P. Leleu, Primitive recursion for higher-order abstract syntax with dependant types, in: FLoC'99 IMLA workshop, Trento, Italy, 1999.
10. Despeyroux J., F. Pfenning and C. Schürmann, Primitive recursion for higher order abstract syntax, Technical Report CMU-CS-96-172, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 (1996).
11. Fiore, M. P., G. D. Plotkin and D. Turi, Abstract syntax and variable binding, in: Longo [18], pp. 193-202.
12. Gabbay, M. J. and A. M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing ? (2001), pp. ?-?, special issue in honour of Rod Burstall. To appear.
13. Gordon A. and T. Melham, Five axioms of alpha-conversion, in: Proc. of TPHOL'96, number 1152 in Lecture Notes in Computer Science, 1996, pp. 173-190.
14. Harper R., Honsell F., Plotkin G. A framework for defining logics. Journal of the ACM. 40:1993;143-184
15. Hofmann M., Semantical analysis of higher-order abstract syntax, in: Longo [18], pp. 204-213.
16. Honsell F., M. Miculan and I. Scagnetto, An axiomatic approach to metareasoning on systems in higher-order abstract syntax, in: Proc. ICALP'01, number 2076 in LNCS (2001), pp. 963-978, also available at http://www.dimi. uniud.it/~miculan/Papers/.
17. Honsell F., Miculan M., Scagnetto I. π-calculus in (co)inductive type theory. Theoretical Computer Science. 253:2001;239-285. first appeared as a talk at TYPES'98 annual workshop
18. INRIA, "The Coq Proof Assistant, http://coq.inria.fr/doc/main.html.
19. G. Longo, editor, "Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science," The Institute of Electrical and Electronics Engineers, Inc., IEEE Computer Society Press, Trento, Italy, 1999.
20. McDowell R., Miller D. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic. 2001;. to appear
21. Miculan M., "Encoding Logical Theories of Programs," Ph.D. thesis, Dipartimento di Informatica, Università di Pisa, Italy (1997).
22. Momigliano A., S. Ambler and R. Crole, A comparison of formalizations of the meta-theory of a language with variable bindings in Isabelle, Technical Report 2001/07, University of Leicester (2001).
23. Paulin-Mohring C., Inductive definitions in the system Coq; rules and properties, in: M. Bezem and J. F. Groote, editors, Proc. of Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 664 (1993), pp. 328-345.
24. Pfenning F., The practice of Logical Frameworks, in: Proc. CAAP'96, number 1059 in Lecture Notes in Computer Science (1996), pp. 119-134.
25. Pfenning F. and C. Elliott, Higher-order abstract syntax, in: Proc. of ACM SIGPLAN '88 Symposium on Language Design and Implementation, The Association for Computing Machinery, Atlanta, Georgia, 1988, pp. 199-208.
26. Pfenning F. and C. Schürmann, System description: Twelf - A meta-logical framework for deductive systems, in: H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), number 1632 in LNAI (1999), pp. 202-206. URL citeseer.nj.nec.com/ pfenning99system.html
27. Pitts A., A first-order theory of names and binding, in: S. Ambler, R. Crole and A. Momigliano, editors, Proc. MERLIN'01, Technical Report 2001/26 (2001), pp. 1-13.
28. Röckl C., D. Hirschkoff and S. Berghofer, Higher-order abstract syntax with induction in Isabelle/HOL: Formalising the π-calculus and mechanizing the theory of contexts, in: F. Honsell and M. Miculan, editors, Proc. FOSSACS 2001, number 2030 in LNCS (2001), pp. 359-373.