Higher-Order Abstract Syntax with induction in Coq-Reference-Cited by-同舟云学术

Higher-Order Abstract Syntax with induction in Coq

Published:1994 Issue: Volume: Page:159-173
ISSN:0302-9743
Container-title:Logic Programming and Automated Reasoning
language:
Short-container-title:

Author:

Despeyroux Joëlle,Hirschowitz André

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58216-9_36.pdf

Reference17 articles.

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. Herbelin, G. Huet, 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 ACM SIGPLAN' 88 International Conference on Programming Language Design and Implementation, Atlanta, Georgia, USA, June 22–24, 1988.

5. J. Hannan and D. Miller. Enriching a meta-language with higher-order features. In Proceedings of the Workshop on Meta-Programming in Logic Programming, Bristol, June 1988.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cut elimination for a logic with induction and co-induction;Journal of Applied Logic;2012-12

2. A dependent nominal type theory;Logical Methods in Computer Science;2012-02-20

3. Nominal Renaming Sets;Logic for Programming, Artificial Intelligence, and Reasoning;2008

4. Essential Incompleteness of Arithmetic Verified by Coq;Lecture Notes in Computer Science;2005

5. Induction and Co-induction in Sequent Calculus;Lecture Notes in Computer Science;2004