A type-theoretic approach to induction with higher-order encodings

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

Volumn 2250, Issue , 2001, Pages 266-281

  Schürmann, Carsten ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC;

FIRST ORDER; HIGHER-ORDER; HIGHER-ORDER ENCODINGS; INDUCTION PRINCIPLES; INTUITIONISTIC LOGIC; POSITIVITY CONDITIONS; REALIZABILITY; REPRESENTATION TECHNIQUES;

ENCODING (SYMBOLS);

EID: 3142760598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_18     Document Type: Conference Paper

References (23)

1. Thierry Coquand. An algorithm for testing conversion in type theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
2. Gilles Dowek, Amy Felty, Hugo Herbelin, Gérard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
3. Jöelle Despeyroux and André Hirschowitz. Higher-order abstract syntax with induction in Coq. In Frank Pfenning, editor, Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, pages 159-173, Kiev, Ukraine, July 1994. Springer-Verlag LNAI 822.
4. Jöelle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), pages 147-163, Nancy, France, April 1997. Springer-Verlag LNCS 1210.
5. Gerhard Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176-210, 405-431, 1935.
6. Andrew D. Gordon and Tom Melham. Five axioms of alpha-conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'96), pages 173-191, Turku, Finland, August 1996. Springer-Verlag LNCS 1125.
7. Murdoch Gabbay and Andrew Pitts. A new approach to abstract syntax involving binders. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 214-224, Trento, Italy, July y1999. IEEE Computer Society Press.
8. Lars Hallnäs. A note on the logic of a logic program. In Proceedings of the Workshop on Programming Logic. University of Göteborg and Chalmers University of Technology, Report PMG-R37, 1987.
9. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
10. Furio Honsell, Marino Miculan, and Ivan Scagnetto. π-calculus in (Co) inductive type theory. Theoretical Computer Science, 253(2):239-285, 2001.
11. Martin Hofmann. Semantical analysis for higher-order abstract syntax. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 204-213, Trento, Italy, July 1999. IEEE Computer Society Press.
12. Pierre Leleu. Induction et Syntaxe Abstraite d'Ordre Supérieur dans les Théories Typées. PhD thesis, Ecole Nationale des Ponts et Chaussees, Marne-la-Vallee, France, December 1998.
13. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover. Springer-Verlag LNCS 828, 1994.
14. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
15. Frank Pfenning. Structural cut elimination. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 156-166, San Diego, California, June 1995. IEEE Computer Society Press.
16. Frank Pfenning. Logical frameworks. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume II. Elsevier Science Publishers, 1999.
17. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction, MPC2000, Proceedings, Ponte de Lima, Portugal, July 2000, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
18. Christine 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, pages 328-345, Utrecht, The Netherlands, March 1993. Springer-Verlag LNCS 664.
19. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.
20. Carsten Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000. CMU-CS-00-146.
21. Carsten Schürmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585-599, Paris, France, August 2001. Springer-Verlag LNCS 2142.
22. Peter Schroeder-Heister. Rules of definitional reflection. In M. Vardi, editor, Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 222-232, Montreal, Canada, June 1993.
23. Roberto Virga. Higher-Order Rewriting with Dependent Types. PhD thesis, Carnegie Mellon University, 1999. CMU-CS-99-167.