An axiomatic approach to metareasoning on nominal algebras in HOAS

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

Volumn 2076 LNCS, Issue , 2001, Pages 963-978

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

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Hgher order abstract syntax; Iduction; Lgical frameworks

Indexed keywords

AUTOMATA THEORY; SYNTACTICS; COMPUTATIONAL LINGUISTICS;

ABSTRACT SYNTAX; AXIOMATIC APPROACH; HIGHER-ORDER ABSTRACT SYNTAX; IDUCTION; INDUCTION PRINCIPLES; LGICAL FRAMEWORKS; LOGICAL FRAMEWORKS; RECURSION OPERATORS; BINDING OPERATOR; INDUCTION; THEORY OF CONTEXTS;

ALGEBRA;

EID: 84879522600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_78     Document Type: Conference Paper

References (19)

1. A. Bucalo, M. Hofmann, F. Honsell, M. Miculan, and I. Scagnetto. Using functor categories to explain and justify an axiomatization of variables and schemata in HOAS. In preparation, 2001.
2. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order syntax in Coq. In Proc. of TLCA'95, LNCS 905. Springer-Verlag, 1995.
3. J. Despeyroux, F. Pfenning, and C. Schürmann. Primitive recursion for higher order abstract syntax. Technical Report CMU-CS-96-172, Carnegie Mellon University, September 1996.
4. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In G. Longo, ed. , Proc. 14th LICS, pages 193-202. IEEE, 1999.
5. M. J. Gabbay. A Theory of Inductive Definitions With-equivalence. PhD thesis, Trinity College, Cambridge University, 2000.
6. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In G. Longo, ed. , Proc. 14th LICS, pages 214-224. IEEE, 1999.
7. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. ACM, 40(1):143-184, Jan. 1993.
8. M. Hofmann. Semantical analysis of higher-order abstract syntax. In G. Longo, ed. , Proc. 14th LICS, pages 204-213. IEEE, 1999.
9. F. Honsell and M. Miculan. A natural deduction approach to dynamic logics. In Proc. of TYPES'95, LNCS 1158, pages 165-182. Springer-Verlag, 1996.
10. F. Honsell, M. Miculan, and I. Scagnetto.-Calculus in (co)inductive type theory. TCS 253(2):239-285, 2001. First appeared as a talk at TYPES'98 annual workshop.
11. INRIA. The Coq Proof Assistant, 2000. http://coq. inria. fr/doc/main. html .
12. R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In Proc. 12th LICS. IEEE, 1997.
13. M. Miculan. Encoding Logical Theories of Programs. PhD thesis, Dipartimento di Informatica, Universit̀a di Pisa, Italy, Mar. 1997.
14. M. Miculan. Encoding and metareasoning of call-by-name-calculus. Available at http://www. dimi. uniud. it/̃miculan/CoqCode/HOAS, 2000.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Inform. and Comput. , 100(1):1-77, 1992.
16. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. of ACM SIG-PLAN '88, pages 199-208, 1988.
17. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Proc. MPC2000, LNCS 1837, pages 230-255. Springer, 2000.
18. C. R̈ockl, D. Hirschkoff, and S. Berghofer. Higher-order abstract syntax with induction in Isabelle/HOL: Formalising the-calculus and mechanizing the theory of contexts. In Proc. FOSSACS 2001, LNCS 2030, pages 359-373. Springer, 2001.
19. I. Scagnetto. Reasoning on Names In Higher-Order Abstract Syntax. PhD thesis, Dip. di Matematica e Informatica, Universit̀a di Udine, 2002. In preparation.