Defining and reasoning about recursive functions: A practical tool for the coq proof assistant

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

Volumn 3945 LNCS, Issue , 2006, Pages 114-129

  Barthe, Gilles ^a   Forest, Julien ^a   Pichardie, David ^a   Rusu, Vlad ^b  

^a INRIA   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER AIDED SOFTWARE ENGINEERING; FUNCTION EVALUATION; GRAPH THEORY; INVERSE PROBLEMS;

COQ PROOF ASSISTANT; EXECUTABLE FUNCTIONS; INDUCTIVE RELATION; PSEUDO-CODES;

RECURSIVE FUNCTIONS;

EID: 33745815252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11737414_9     Document Type: Conference Paper

References (25)

1. A. Balaa and Y. Bertot. Fix-point equations for well-founded recursion in type theory, In M. Aagaard and J. Harrison, editors, Proceedings of TPHOLs'00, volume 1689 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2000.
2. G. Barthe and P. Courtieu. Efficient Reasoning about Executable Specifications in Coq. In V. Carreño, C. Muñoz, and S. Tahar, editors, Proceedings of TPHOLs'02, volume 2410 of Lecture Notes in Computer Science, pages 31-46. Springer-Verlag, 2002.
3. G. Barthe, G. Dufay, L. Jakubiec, B. Serpette, and S. Melo de Sousa. A Formal Executable Semantics of the JavaCard Platform. In D. Sands, editor, Proceedings of ESOP'01, volume 2028 of Lecture Notes in Computer Science, pages 302-319. Springer-Verlag, 2001.
4. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Mathematical Structures in Computer Science, 14:97-141, February 2004.
5. S. Berghofer and T. Nipkow. Executing higher order logic. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Proceedings of TYPES'00, volume 2277 of Lecture Notes in Computer Science, pages 24-40. Springer-Verlag, 2002.
6. Y. Bertot, V. Capretta, and K. Das Barman. Type-theoretic functional semantics. In V. Carreño, C. Muñoz, and S. Tahar, editors, Proceedings of TPHOLs'02, volume 2410 of Lecture Notes in Computer Science, pages 83-98. Springer-Verlag, 2002.
7. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development - Coq'Art: The Calculus of Inductive Constructions, Texts in Theoretical Computer Science. Springer-Verlag, 2004.
8. F. Blanqui. Definitions by rewriting in the calculus of constructions. Mathematical Structures in Computer Science, 15(1):37-92, February 2005.
9. A. Bove and V. Capretta. Modelling general recursion in type theory. Mathematical Structures in Computer Science, 15:671-708, February 2005.
10. D. Cachera, T. Jensen, D. Pichardie, and V. Rusu. Extracting a data flow analyser in constructive logic. Theoretical Computer Science, 342, 2005. To appear.
11. D. Cachera and D. Pichardie. Embedding of Systems of Affine Recurrence Equations in Coq. In Proceedings of TPHOLs'03, number 2758 in Lecture Notes in Computer Science, pages 155-170. Springer-Verlag, 2003.
12. Venanzio Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2):1-18, 2005.
13. Coq Development Team. The Coq Proof Assistant User's Guide. Version 8.0, January 2004.
14. P. Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2):525-549, June 2000.
15. M.J.C. Gordon and T.F. Melham, editors. Introduction to HOL: A theorem proving environment for higher-order logic. Cambridge University Press, 1993.
16. B. Grégoire and A. Mahboubi. Proving equalities in a commutative ring done right in coq. In J. Hurd and T. Melham, editors, Proceedings of TPHOLs'05, volume 3603 of Lecture Notes in Computer Science, pages 98-113. Springer-Verlag, 2005.
17. M. Katsushige, N. Kiyoshi, and K. Hitoshi. Pipelined LMS Adaptative Filter Using a New Look-Ahead Transformation. IEEE Transactions on Circuits and Systems, 46:51-55, January 1999.
18. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In Proceedings of POPL'06. ACM Press, 2006.
19. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14:69-111, 2004.
20. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
21. B. Nordström. Terminating general recursion. BIT, 28(3):605-619, 1988.
22. Color Project, http://color.inria.fr
23. N. Shankar, S. Owre, and J.M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Laboratory, SRI International, February 1993. Supplemented with the PVS2 Quick Reference Manual, 1997.
24. K. Slind. Reasoning about Terminating Functional Programs. PhD thesis, TU Münich, 1999.
25. H. Xi. Dependent types for program termination verification. Higher-Order and Symbolic Computation, 15(1):91-131, March 2002.