The theory of contexts for first order and higher order abstract syntax

Electronic Notes in Theoretical Computer Science

Volumn 62, Issue , 2002, Pages 116-135

  Honsell, Furio ^a   Miculan, Marino ^a   Scagnetto, Ivan ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORMAL LOGIC; OBJECT ORIENTED PROGRAMMING; SYNTACTICS;

ABSTRACT SYNTAX; COMPUTER AIDED PROOF DEVELOPMENT; FIRST-ORDER ENCODING; FORMAL REASONING;

ABSTRACTING;

EID: 19144366149     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00323-8     Document Type: Conference Paper

References (21)

1. Barendregt H. The lambda calculus: its syntax and its semantics. Studies in Logic and the Foundations of Mathematics. 1984;North-Holland
2. A. Bucalo, M. Hofmann, F. Honsell, M. Miculan, and I. Scagnetto. Consistency of the theory of contexts. Submitted, 2001.
3. Coquand T. Metamathematical investigations of a calculus of constructions. Logic and Computer Science, volume 31. 1990;91-122 Academic Press
4. C. Cornes and D. Terrasse. Automating inversion of inductive predicates in coq. In Proc. of TYPES'95, LNCS 1158, pages 85-104. Springer-Verlag, 1996.
5. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order syntax in Coq. In Proc. of TLCA'95, LNCS 905, 1995. Springer-Verlag.
6. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In Longo [14], pages 214-224.
7. Gabbay M.J., Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing. 2001;. To appear, ?:?-?
8. Harper R., Honsell F., Plotkin G. A framework for defining logics. J. ACM. 40:(1):Jan. 1993;143-184
9. D. Hirschkoff. Bisimulation proofs for the π-calculus in the Calculus of Constructions. In Proc. TPHOL'97, LNCS 1275. Springer-Verlag, 1997.
10. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Longo [14], pages 204-213.
11. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on systems in higher-order abstract syntax. In Proc. ICALP'01, LNCS 2076, pages 963-978. Springer, 2001.
12. Honsell F., Miculan M., Scagnetto I. π-calculus in (co)inductive type theory. Theoretical Computer Science. 253:(2):2001;239-285
13. INRIA. The Coq Proof Assistant. http://coq.inria.fr/doc/main.html.
14. G. Longo, editor. Proc. 14th LICS, Trento, Italy, July 1999.
15. McKinna J., Pollack R. Some lambda calculus and type theory formalized. Journal of Automated Reasoning. 23:(3-4):Nov. 1999
16. M. Miculan. Encoding Logical Theories of Programs. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy, Mar. 1997.
17. M. Miculan. Developing (meta)theory of lambda-calculus in the Theory of Contexts. In S. Ambler, R. Crole, and A. Momigliano, editors, Proc. MERLIN 2001, ENTCS 58.1, Elsevier, 2001. Preliminar version available as TR 2001/26, Department of Mathematics and Computer Science, University of Leicester.
18. C. Paulin-Mohring. Inductive definitions in the system Coq; rules and properties. In Proc. TLCA, LNCS 664, pages 328-345. Springer-Verlag, 1993.
19. F. Pfenning. The practice of Logical Frameworks. In Proc. CAAP'96, LNCS 1059, pages 119-134. Springer-Verlag, April 1996.
20. C. Röckl, 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, LNCS 2030, pages 359-373. Springer-Verlag, 2001.
21. I. Scagnetto. Reasoning on Names In Higher-Order Abstract Syntax. PhD thesis, Dipartimento di Matematica e Informatica, Università di Udine, 2002.