Program extraction from large proof developments

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

Volumn 2758, Issue , 2003, Pages 205-220

  Cruz Filipe, Lús ^a,b   Spitters, Bas ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Constructive mathematics; Formalized mathematics; Program extraction; Type Theory

Indexed keywords

ALGORITHMS; EXTRACTION; FORMAL LOGIC;

COMPUTER IMPLEMENTATIONS; CONSTRUCTIVE MATHEMATICS; CONSTRUCTIVE PROOF; COQ PROOF ASSISTANT; FORMALIZED MATHEMATICS; FUNDAMENTAL THEOREMS; PROGRAM EXTRACTION; TYPE THEORY;

THEOREM PROVING;

EID: 33644906735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10930755_14     Document Type: Article

References (22)

1. H. P. Barendregt. Lambda calculi with types. In Handbook of logic in computer science, Vol. 2, pages 117-309. Oxford Univ. Press, New York, 1992.
2. Errett Bishop. Foundations of Constructive Analysis. McGraw-Hill Book Company, 1967.
3. Errett Bishop. Mathematics as a numerical language. In Intuitionism and Proof Theory (Proceedings of the summer Conference at Buffalo, N. Y., 1968), pages 53-71. North-Holland, Amsterdam, 1970.
4. Venanzio Capretta. Abstraction and Computation. PhD thesis, University of Nijmegen, 2002.
5. Jesper Carlström. Subsets, quotients and partial functions in martin-löf's type theory. In Proceedings of the TYPES Conference 2002, to appear, LNCS. Springer-Verlag, 2003.
6. Alberto Ciaffaglione and Pietro Di Gianantonio. A co-inductive approach to real numbers, volume 1956 of LNCS. Springer-Verlag, 2000.
7. Judicaël Courant. MC2: A module calculus for pure type systems. Technical Report 1292, LRI, September 2001.
8. ∼severi/publications.html
9. ∼herman/note.ps.gz
10. Herman Geuvers, Randy Pollack, Freek Wiedijk, and Jan Zwanenburg. The algebraic hierarchy of the FTA Project. In Sebasitani S. Linton, editor, Journal of Symbolic Computation, Special Issue on the Integration of Automated Reasoning and Computer Algebra Systems, pages 271-286. Elsevier, 2002.
11. Herman Geuvers, Freek Wiedijk, and Jan Zwanenburg. A constructive proof of the Fundamental Theorem of Algebra without using the rationals. In Paul Callaghan, Zhaohui Luo, James McKinna, and Robert Pollack, editors, Types for Proofs and Programs, Proceedings of the International Workshop, TYPES 2000, volume 2277 of LNCS, pages 96-111. Springer, 2001.
12. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In Proceedings ICFP'02.
13. Pierre Letouzey. A new extraction for Coq. In Proceedings of the TYPES Conference 2002, to appear, LNCS. Springer-Verlag, 2003.
14. Per Martin-Löf. Constructive mathematics and computer science. In Logic, Methodology and the Philosophy of Science VI, pages 153-175. North-Holland, 1982.
15. Milad Niqui. Exact arithmetic on Stern-Brocot tree. 2003. submitted.
16. ω's programs from proofs in the Calulus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, 1989. ACM.
17. Loïc Pottier. Quotients dans le CCI. Technical Report RR-4053, INRIA, November 2000. http://www-sop.inria.fr/rapports/sophia/RR-4053.html.
18. Frédéric Prost. Marking techniques for extraction. Technical Report 95-47, Laboratoire de l'informatique du Parallélisme, Ecole Normale Supérieure de Lyon, 1995.
19. H. Schwichtenberg. Minimal logic for computable functionals. Technical report, Mathematisches Institut der Universität München, 2002.
20. The Coq Development Team. The Coq Proof Assistant Reference Manual Version 7.3. INRIA-Rocquencourt, 2002.
21. A.S. Troelstra. Realizability, volume Handbook of Proof Theory, pages 407-473. North-Holland, 1998.
22. A.S. Troelstra and D. van Dalen. Constructivism in mathematics. An introduction. Number 123 in Studies in Logic and the Foundations of Mathematics. North-Holland, 1988.