Changing data structures in type theory: A study of natural numbers

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

Volumn 2277 LNCS, Issue , 2002, Pages 181-196

  Magaud, Nicolas ^a   Bertot, Yves ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; GROUP THEORY; COMPUTATION THEORY;

AUTOMATIC TRANSLATION; BINARY REPRESENTATIONS; INDUCTIVE DEFINITIONS; INDUCTIVE STRUCTURES; NATURAL NUMBER; PROOF SYSTEM; TYPE THEORY;

THEOREM PROVING;

EID: 33750698830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45842-5_12     Document Type: Conference Paper

References (17)

1. Penny Anderson. Representing proof transformations for program optimization. In International Conference on Automated Deduction, LNAI 814, Springer-Verlag, 1994.
2. Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In Harrison and Aagaard [9], pages 1-16.
3. B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin, A. Saïbi, and B. Werner. The Coq Proof Assistant Reference Manual - Version V6.1. Technical Report 0203, INRIA, August 1997. revised version distributed with Coq.
4. S. Boutin. Using reflection to build efficient and certified decision procedures. In Martin Abadi and Takahashi Ito, editors, TACS'97, LNCS 1281, Springer-Verlag, 1997.
5. Yann Coscoy. A natural language explanation for formal proofs. In Christian Rétoré, editor, Logical Aspects of Computational Linguistics, LNAI 1328, Springer-Verlag, 1996.
6. Ewen Denney. A prototype proof translator from HOL to Coq. In Harrison and Aagaard [9], pages 108-125.
7. Amy P. Felty and Douglas J. Howe. Hybrid interactive theorem proving using nuprl and hol. In International Conference on Automated Deduction, number 1249 in LNAI. Springer-Verlag, 1997.
8. H. Geuvers, F. Wiedijk, and J. Zwanenburg. Equational reasoning via partial reflection. In Harrison and Aagaard [9], pages 163-179.
9. J. Harrison and M. Aagaard, editors. Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, LNCS 1869, Springer-Verlag, 2000.
10. Peter Madden. The specialization and transformation of constructive existence proofs. In N.S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 131-148. Morgan Kaufmann, 1989.
11. Lena Magnusson. The Implementation of ALF - a Proof Editor based on Martin-Löf 's Monomorphic Type Theory with Explicit Substitutions. PhD thesis, Chalmers University of Technology / Göteborg University, 1995.
12. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
13. Erica Melis and Jon Whittle. Analogy in inductive theorem proving. Journal of Automated Reasoning, 22:117-147, 1999.
14. Christine Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, LNCS 664, Springer-Verlag, 1993. LIP research report 92-49.
15. Julian Richardson. Automating changes of data type in functional programs. In Proceedings of KBSE-95. IEEE Computer Society, 1995.
16. Simon Thompson. Type Theory and functional Programming. Addison-Wesley, 1991.
17. Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In Proceedings, 14th Symposium on Principles of Programming Languages POPL'87. ACM, 1987.