Automating inversion of inductive predicates in Coq

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

Volumn 1158 LNCS, Issue , 1996, Pages 85-104

  Cornes, Cristina ^a   Terrasse, Delphine ^b  

^a INRIA ROCQUENCOURT   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CASE ANALYSIS; CLOSURE PROPERTY; FORMAL CONTEXTS; INDUCTIVE DEFINITIONS; LOGICAL FRAMEWORKS; PROOF ASSISTANT; TYPE THEORY;

LOGIC PROGRAMMING;

THEOREM PROVING;

EID: 84885659602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_64     Document Type: Conference Paper

References (17)

1. P, Aczel: An Introduction to Inductive Definitions. The Handbook of Mathematical Logic, J. Barwise ed., North-Holland, (1992) 739-782
2. L. Augustsson: Compiling Pattern Matching. In J.P. Jouannaud, ed., Conference on Functional Programming Languages and Computer Architecture (LNCS 201), pages, 368-381, Nancy, France, 1985.
3. K. Clark: Negation as Failure. Logic and Databases, Ed.H. Gallaire, J.Minker. Plenum Press New York, pp. 293-322, 1978.
4. T. Coquand: Pattern Matching with Dependent Types. Informal Proceedings Types for Proofs and Programs, June 1992.
5. T. Coquand, J.M. Smith: What is the status of pattern matching in type theory. El Wintermote, pp. 112-114, June 1993.
6. T. Coquand, G. Huet: The Calculus of Constructions. Information and Computation. Vol. 76, Nos. 2/3 February/March 1988.
7. C. Comes: Inversion des Predicats Inductifs. Universite Paris VII, Rapport de stage de DEA Informatique Fondamentale. 1993.
8. C. Cornes et al.: The Coq Proof Assistant Reference Manual, Version 5.10. Projet Coq, Inria-Rocquencourt and CNRS-ENS Lyon, France.
9. C. Cornes, D. Terrasse: Inverting Inductive Predicates in Coq. Rapport de Recherche I.N.R.I.A. to appear.
10. E. Gimenez: Codifying guarded definitions with recursive schemes. In BRA Workshop on Types for Proofs and Programs, June 1994. LNCS 996 (1994) 39-59.
11. E. Gimenez: The implementation of coinductive types in Coq: an experiment with the Alternating Bit Protocol. In BRA Workshop Types for Proofs and Programs, Turin, June 1995. To appear in the LNCS series.
12. Z. Luo: Computation and Reasoning: A Type Theory for Computer Science. 1994. Oxford University Press.
13. P. Manoury, M. Simonot: Automatizing Termination Proofs of Recursively Defined Functions. Theoretical Computer Science. Vol. 135, pp. 319-343, 1994.
14. P. Martin-Löf: Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
15. Ch. Paulin-Mohring: Inductive Definitions in the System Coq: Rules and Properties. Proceedings of the International Conference on Typed Lambda Calculi and Applications (TLCA), Springer-Verlag LNCS 664 (1992) 328-345.
16. T. Streicher: Semantical Investigations into Intensional Type Theory. LMU Mtinchen. Habilitationsschrift. 1993
17. B. Werner: Une Theorie des Constructions Inductives. These Universite Paris VII, May 1994.