Fix-point equations for weil-founded recursion in type theory

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

Volumn 1869, Issue , 2000, Pages 1-16

  Balaa, Antonia ^a   Bertot, Yves ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949183434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_1     Document Type: Conference Paper

References (16)

1. Peter Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, 1977.
2. Robert Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harber, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing mathematics with the Nuprl proof development system. Prentice-Hall, 1986.
3. Robert L. Constable and Nax P. Mendler. Recursive definitions in type theory. In Rohit Parikh, editor, Logics of Programs, volume 193 of LNCS, pages 61-78. Springer Verlag, June 1985.
4. Thierry Coquand and Christine Paulin-Mohring. Inductively defined types. In P. Martin-L6f and G. Mints, editors, Proceedings of Colog'88, volume 417 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
5. Thierry Coquand and Henrik Persson. Grobner bases in type theory. In Types'98, volume 1658 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
6. Michael J. C. Gordon and Thomas F. Melham. Introduction to HOL: a theorem proving environment for higher-order logic. Cambridge University Press, 1993.
7. John Harrison. Inductive definitions: Automation and application. In P. J. Wind-ley, T. Schubert, and J. Alves-Foss, editors, Higher Order Logic Theorem Provoing and Its Applications: Proceedings of the 8th International Workshop, volume 971 of Lecture Notes in Computer Sciences. Springer-Verlag, 1995.
8. Thomas F. Melham. A package for inductive relation definitions in HOL. In Proceedings of the 1991 International Workshop on the HOL Theorem Proving system and its Applications, pages 350-357. IEEE Computer Society Press, 1992.
9. Bengt Nordstrom. Terminating general recursion. BIT, 28, 1988.
10. Catherine Parent. Synthesizing proofs from programs in the Calculus of Inductive Constructions. In Mathematics of Program Construction, volume 947 of Lecture Notes in Computer Science. Springer-Verlag, July 1995.
11. Christine Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, 1993. LIP research report 92-49.
12. Lawrence C. Paulson. Constructing recursion operators in intuitionistic type theory. Technical report 57, University of Cambridge, Computer Laboratory, October 1984.
13. Lawrence C. Paulson and Tobias Nipkow. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
14. Frank Pfenning and Christine Paulin-Mohring. Inductively defined types in the Calculus of Constructions. In Proceedings of Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science. Springer-Verlag, 1990. technical report CMU-CS-89-209.
15. Konrad Slind. Function definition in higher order logic. In Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science. Sprinter Verlag, August 1996.
16. Laurent Thery. A certified version of Buchberger's algorithm. In Automated Deduction (CADE-15), volume 1421 of Lecture Notes in Artificial Intelligence. Springer-Verlag, July 1998.