A large-scale experiment in executing extracted programs

Electronic Notes in Theoretical Computer Science

Volumn 151, Issue 1, 2006, Pages 75-91

  Cruz Filipe, Luís ^a   Letouzey, Pierre ^b  

^a CLC   (Portugal)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Complexity; Constructive reals; Formalization of Mathematics; Fundamental Theorem of Algebra; Program extraction

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; THEOREM PROVING;

COMPLEXITY; CONSTRUCTIVE REALS; FORMALIZATION OF MATHEMATICS; FUNDAMENTAL THEOREM OF ALGEBRA; PROGRAM EXTRACTION;

LARGE SCALE SYSTEMS;

EID: 33644911752     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.024     Document Type: Conference Paper

References (24)

1. K. Aehlig, U. Berger, M. Hofmann, and H. Schwichtenberg An arithmetic for non-size-increasing polynomial-time computation Theoretical Computer Science 318 2004 3 27
2. R. Benzinger Automated complexity analysis of Nuprl extracted programs Journal of Functional Programming 11 1 January 2001 3 31
3. S. Berghofer. Proofs, Programs and Executable Specifications in Higher Order Logic. PhD thesis, Institut für Informatik, Technische Universität München, 2003
4. P. Callaghan Z. Luo J. McKinna R. Pollack Types for Proofs and Programs, Proceedings of the International Workshop TYPES 2000 LNCS volume 2277 2001 Springer-Verlag
5. L. Cruz-Filipe. Constructive Real Analysis: a Type-Theoretical Formalization and Applications. PhD thesis, University of Nijmegen, April 2004
6. L. Cruz-Filipe, H. Geuvers, and F. Wiedijk C-CoRN: the Constructive Coq Repository at Nijmegen A. Asperti G. Bancerek A. Trybulec Mathematical Knowledge Management, Third International Conference MKM 2004 LNCS volume 3119 2004 Springer-Verlag 88 103
7. L. Cruz-Filipe, and B. Spitters Program extraction from large proof developments D. Basin B. Wolff Theorem Proving in Higher Order Logics, 16th International Conference TPHOLs 2003 LNCS volume 2758 2003 Springer-Verlag 205 220
8. H. Benl Proof theory at work: Program development in the Minlog system Wolfgang Bibel Peter H. Schmidt Automated Deduction: A Basis for Applications Systems and Implementation Techniques Volume II 1998 Kluwer Academic Publishers Dordrecht
9. H. Geuvers and M. Niqui. Constructive reals in Coq: Axioms and categoricity. In Callaghan et al. [4], pages 79-95
10. H. Geuvers, F. Wiedijk, and J. Zwanenburg. A constructive proof of the Fundamental Theorem of Algebra without using the rationals. In Callaghan et al. [4], pages 96-111
11. S. Hayashi and H. Nakano. PX, a computational logic. Technical report, Research Institute for Mathematical Sciences, Kyoto University, 1987
12. M. Kneser Ergänzung zu einer arbeit von hellmuth kneser über den fundamentalsatz der algebra Math. Zeitschrift 177 1981 285 287
13. C. Kreitz. The Nuprl Proof Development System, Version 5. Cornell University, Ithaca, NY, 2002. Available at http://www.nuprl.org
14. P. Letouzey A new extraction for Coq H. Geuvers F. Wiedijk Types for Proofs and Programs LNCS volume 2646 2003 Springer-Verlag 200 219
15. P. Letouzey. Programmation functionnelle certifiée - L'extraction de programmes dans l'assistant Coq. PhD thesis, Université Paris-Sud, July 2004
16. M. Niqui, and Y. Bertot QArith: Coq formalisation of lazy rational arithmetic S. Berardi M. Coppo F. Damiani Types for Proofs and Programs LNCS volume 3085 2004 Springer-Verlag 309 323
17. Aleksey Nogin Writing constructive proofs yielding efficient extracted programs Didier Galmiche Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics Electronic Notes in Theoretical Computer Science 37 2000 Elsevier Science Publishers
18. C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. Thèse d'université, Paris 7, January 1989
19. C. Paulin-Mohring, and B. Werner Synthesis of ml programs in the system Coq Journal of Symbolic Computation 15 1993 607 640
20. L. Pottier. Extraction dans le calcul des constructions inductives. In Journées Francophones des Langages Applicatifs, 2001
21. H. Schwichtenberg. Constructive analysis with witnesses. Technical report, Ludwig-Maximilians-Universität, München, 2003. Proceedings of Marktoberdorf '03 Summer School
22. The Coq Development Team The Coq Proof Assistant Reference Manual Version 8.0 Available at http://coq.inria.fr February 2004
23. L. Théry A certified version of Buchberger's algorithm C. Kirchner H. Kirchner Automated Deduction - CADE-15: 15th International Conference on Automated Deduction Lindau, Germany, July 1998 LNCS volume 1421 1998 Springer-Verlag 349 364
24. S. Wolfram The Mathematica Book Fifth Edition 2003 Wolfram Media