Synthesizing proofs from programs in the calculus of inductive constructions

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

Volumn 947, Issue , 1995, Pages 351-379

  Parent, Catherine ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; EXTRACTION; SPECIFICATIONS;

ANNOTATED PROGRAM; CALCULUS OF INDUCTIVE CONSTRUCTIONS; PROOF OBLIGATIONS; TYPE THEORY;

INVERSE PROBLEMS;

EID: 84958764995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60117-1_20     Document Type: Conference Paper

References (20)

1. H. Barendregt. Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen, September 1991.
2. R. Burstall and J. McKinna. Deliverables: a categorical approach to program development in type theory. Technical Report 92-242, LFCS, October 1992. Also in [NPP92]
3. C. Comes, J. Courant, J.C. Filliâtre, G. Huet, P. Manoury, C. Paulin-Mohring, C. Muñoz, C. Murthy, C. Parent, A. Saabi, and B. Werner. Coq V5.10 Reference Manual. Technical report, 1994. Disponible en ftp anonyme sur ftp.inria.fr, à paraitre.
4. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
5. T. Coquand. Une théorie des constructions. PhD thesis, Université Paris VII, 1985.
6. 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 - Version 5.8. Technical Report 154, Projet Formel - INRIA-Rocquencourt-CNRS- ENS Lyon, May 1993.
7. J.Y. Girard. Interprétation fonctionnelle et élimination des coupures de I’arithmetique d’ordre supérieur. PhD thesis, Université Paris 7, 1972.
8. C.A.R. Hoare. An Axiomatic Basis for Computer Programming. Communications of the ACM, 12(10), October 1969.
9. W.A. Howard. The formulaes-as-types notion of construction. In J.R. Hindley, editor, To H.B.Curry: Essays on Combinatory Logic, lambda-calculus and formalism. Seldin, J.P., 1980.
10. P. Martin-Löf. Intuitionistic Type Theory. Studies in Proof Theory. Bibliopolis, 1984.
11. P. Manoury and M. Simonot. Des preuves de totalite de fonctions comme synthese de programmes. PhD thesis, Universite PARIS 7, December 1992.
12. B. Nordström, K. Petersson, and G. Plotkin, editors. Proceedings of the 1992 workshop on types for proofs and programs, June 1992.
13. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löf ’s Type Theory: an introduction. Oxford Science Publications, 1990.
14. C. Parent. Developing certified programs in the system Coq - The Program tactic. In H. Barendregt and T. Nipkow, editors, Types For Proofs and Programs, volume 806 of LNCS, pages 291-312, May 1993.
15. C. Parent. Synthese de preuves de programmes dans le Calcul des Constructions. PhD thesis, Ecole Normale Superieure de Lyon, January 1995.
16. F. Pfenning and Paulin-Mohring C. Inductively Defined Types in the Calculus of Constructions. In 5th International Conference on Mathematical Foundations of Programming Semantics, volume 442 of LNCS, pages 209-228, 1989.
17. C. Paulin-Mohring. Extracting Fω's programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, January 1989.
18. C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. PhD thesis, Universite Paris VII, 1989.
19. C. Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In Typed Lambda Calculi and Applications, volume 664 of LNCS, March 1993. Also in research report 92-49, LIP-ENS Lyon, December 1992.
20. E. Poll. A Programming Logic Based on Type Theory. PhD thesis, Technis- che Universiteit Eindhoven, 1994.