Higher-order abstract syntax in Coq

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

Volumn 902, Issue , 1995, Pages 124-138

  Despeyroux, Joëlle ^a   Felty, Amy ^b   Hirschowitz, André ^c  

^a INRIA   (France)

^b LUCENT TECHNOLOGIES   (United States)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY; SYNTACTICS;

FUNCTIONAL LANGUAGES; HIGHER-ORDER ABSTRACT SYNTAX; INDUCTIVE-TYPE; LOGICAL FORMULAS; NATURAL DEDUCTION; PROOF DEVELOPMENT; SIMPLY TYPED LAMBDA CALCULUS; TYPE SOUNDNESS;

THEOREM PROVING;

EID: 84947431245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014049     Document Type: Conference Paper

References (14)

1. A. Asperti and G. Longo. Categories, Types, and Structures. MIT Press, Foundations of Computing Series, London, England, 1991.
2. A. Avron, F. Honsell, I. A. Mason, and R. Pollack. Using typed lambda calculus to implement formal systems on a machine. Journal of Automated Reasoning, 9(3):309-354, Dec. 1992.
3. J. Despeyroux and A. Hirschowitz. Higher-order syntax and induction in coq. In Proceedings of the fifth Int. Conf. on Logic Programming and Automated Reasoning (LPAR 94), Kiev, Ukraine, July 16-21, 1994, 1994. Also available as an INRIA Research Report RR-2292, Inria-Sophia-Antipolis, France, June 1994.
4. G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The coq proof assistant user's guide. Technical Report 154, INRIA, 1993.
5. A. Felty. A logic programming approach to implementing higher-order term rewriting. In L.-H. Eriksson, L. Hallnas, and P. Schroeder-Heister, editors, Proceedings of the January 1991 Workshop on Extensions to Logic Programming, pages 135-161. Springer-Verlag LNCS, 1992.
6. A. Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43-81, Aug. 1993.
7. J. Hannan. Investigating a Proof-Theoretic Meta-Language for Functional Programs. PhD thesis, University of Pennsylvania, Technical Report MS-CIS-91-09, Jan. 1991.
8. J. Hannan and D. Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 2:415-459, 1992.
9. J. Hannan and F. Pfenning. Compiler verification in LF. In Seventh Annual Symposium on Logic in Computer Science, pages 407-418, 1992.
10. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, Jan. 1993.
11. S. Michaylov and F. Pfenning. Natural semantics and some of its meta-theory in elf. In L.-H. Eriksson, L. Hallnas, and P. Schroeder-Heister, editors, Proceedings of the January 1991 Workshop on Extensions to Logic Programming, pages 299-344. Springer-Verlag LNCS, 1992.
12. D. Miller. Unification of simply typed lambda-terms as logic programming. In Eighth International Logic Programming Conference. MIT Press, 1991.
13. C. Paulin-Mohring. Inductive definitions in the system Coq; rules and properties. In M. Bezem and J. F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, volume 664, pages 328-345. Springer Verlag Lecture Notes in Computer Science, 1993.
14. F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In Eleventh International Conference on Automated Deduction, pages 537551. Springer-Verlag LNCS, 1992.