Higher-order abstract syntax with induction in Coq

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

Volumn 822 LNAI, Issue , 1994, Pages 159-173

  Despeyroux, Joëlle ^a   Hirschowitz, André ^b  

^a INRIA   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; TECHNOLOGY TRANSFER; THEOREM PROVING;

ABSTRACT SYNTAX; EXTENSIONALITY; HIGHER-ORDER; HIGHER-ORDER ABSTRACT SYNTAX; INDUCTION PRINCIPLES; LOGICAL FRAMEWORKS; SECOND ORDERS; TYPE SYSTEMS;

SYNTACTICS;

EID: 85022757597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58216-9_36     Document Type: Conference Paper

References (17)

1. A. Avron, F. Honsell, and A. Mason. Using typed λ-calculus to implement formal systems on a machine. Technical Report ECS-LFCS-87-31, Edinburgh University, July 1987.
2. Th. Despeyroux and A. Hirschowitz. A categorical approach to higher-order abstract syntax, forthcoming paper, 1994.
3. G. Dowek, A. Felty, H. Herbehn, G. Ituet, C. Murthy, C. Parent, Ch. Paulin-Mohring, and B. Werner. The coq proof assistant user’s guide,, version 5.8. Technical Report 154, Inria, Rocquencourt, France, May 1993.
4. C. Elliot and F. Pfenning. Higher-order abstract syntax. In Proceedings of the A CM SIGPLAN’ 88 International Conference on Programming Language Design and Implementation, Atlanta, Georgia, USA, June 22-24, 1988.
5. J. Hannah and D. Miller. Enriching a recta-language with higher-order features. In Proceedings of the Workshop on Meta-Programmin9 in Logic Programming, Bristol, June 1988.
6. J. Hannan and F. Pfenning. Compiler verification in LF. In IEEE, editor, Proceedings of the LICS International Conference on Logic In Computer Sciences, Santa Cruz, California, June 1992.
7. R. Harper. Systems of polymorphic type assignment in LF. Technical Report CMU-CS-90-144, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 1990.
8. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In IEEE, editor, Proceedings of the second LICS International Conference on Logic In Computer Sciencesé Cornellé USA, pages 194-204, 1987.
9. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Technical Report ECS-LFCS-91-162, Edinburgh University, June 1991.
10. G. Huet. Constructive computation theory, part I. Lecture notes. October 1992.
11. G. Kahn. Natural semantics. In Proceedings of the Syrup. on Theorical Aspects of Computer Science, Passaué Germany, 1987. also available as a Research Report RR-601, Inria, Sophia-Antipolis, February 1987.
12. S. Michaylov and F. Pfenning. Natural semantics and some of its recta-theory in elf. In Lars Halln’as, editor, Proceedings of the Second Workshop on Extentions of Logic Programing, Springer-Verlag LNCS, 1991. also available as a Technical Report MPI-I-91-211, Max-Planck-Institute for Computer Science,Saarbrucken, Germany, August 199é.
13. D. Miller and G. Nadathur. An overview of λ-prolog. In MIT Press, editor, Proceedings of the International Logic Programming Conference, Seattle, Washington, pages 910-827, August 1988.
14. Ch. Paulin-Mohring. Inductive definitions in the system coq. rules and properties. In J.F. Groote M. Bezem, editor, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA’93, Springer-Verlag LNCS 664, pages 328-345, 1992. also available as a Research Report RR-92-49, Dec. 1992, ENS Lyon, France.
15. L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, 1989.
16. F. Pfenning. Elf: A language for logic definition and verified metaprogramming. In Proceedings of the fourth A CM-IEEE Syrup. on Logic In Computer Science, Asilomar, California, USA, June 1989.
17. F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In Proceedings of the CADE-11 Conference, 1991.