A new extraction for Coq

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

Volumn 2646, Issue , 2003, Pages 200-219

  Letouzey, Pierre ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; EXTRACTION;

AUTOMATIC GENERATION; COQ PROOF ASSISTANT; EXTRACTION MECHANISMS; FUNCTIONAL CODES; PROOF OF CORRECTNESS; THEORETICAL MODELING;

THEOREM PROVING;

EID: 35248843145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_12     Document Type: Article

References (18)

1. S. Berardi. Pruning simply typed λ-calculi. Journal of Logic and Computation, 6(2), 1996.
2. L. Boerio. Extending pruning techniques to polymorphic second order λ-calculus. In Proceedings ESOP'94, volume 788. Lecture Notes in Computer Science, 1994.
3. L. Cruz-Filipe. A constructive formalization of the fundamental theorem of calculus. In Proceedings TYPES'2002.
4. S. Peyton Jones et al. Haskell 98, A Non-strict, Purely Functional Language, 1999. Available at http://haskell.org/.
5. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In Proceedings ICFP'2002. To appear.
6. F. Wiedijk H. Geuvers, R. Pollack and J. Zwanenburg. The algebraic hierarchy of the fta project. Journal of Symbolic Computation, Special Issue on the Integration of Automated Reasoning and Computer Algebra Systems, pages 271-286, 2002.
7. S. Hayashi and H. Nakano. Px, a computational logic. Technical report, Research Institute for Mathematical Sciences, Kyoto University, 1987.
8. P. Jackson. The Nuprl Proof Development System, Version 4-1 Reference Manual and User's Guide. Cornell University, Ithaca, NY, 1994.
9. 5 Report on the Algorithmic Language Scheme, 1998. Available at http://www.scheme.org/.
10. X. Leroy, J. Vouillon, and D. Doliguez. The Objective Caml system - release 3.04, 2002. Available at http://caml.inria.fr/.
11. D. Monniaux. Réalisation mécanisée d'interpréteurs abstraits. Rapport de DEA, Université Paris VII, 1998.
12. ω's programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, January 1989. ACM.
13. C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. Thèse d'université, Paris 7, January 1989.
14. C. Paulin-Mohring and B. Werner. Synthesis of ml programs in the system coq. Journal of Symbolic Computation, 15:607-640, 1993.
15. L. Pottier. Extraction dans le calcul des constructions inductives. In Journées Francophones des Langages Applicatifs, 2001.
16. P. Severi and N. Szasz. Studies of a theory of specifications with built-in program extraction. Journal of Automated Reasoning, 27(1), 2001.
17. The Coq Development Team. The Coq Proof Assistant Reference Manual - Version 7.3, May 2002. Available at http://coq.inria.fr/doc-eng.html.
18. B. Werner. Méta-théorie du Calcul des Constructions Inductives. PhD thesis, Univ. Paris VII, 1994.