Changing data representation within the Coq system

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

Volumn 2758, Issue , 2003, Pages 87-102

  Magaud, Nicolas ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC; NUMBER THEORY;

DATA REPRESENTATIONS; GENERAL METHOD; IMPROVED TECHNIQUES; MATHEMATICAL CONCEPTS; RECURSION OPERATORS; REDUCTION RULES; TARGET SETTING; THEOREM PROVERS;

THEOREM PROVING;

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

References (17)

1. A. Balaa and Y. Bertot. Fix-point Equations for Well-Founded Recursion in Type Theory. In Theorem Proving in Higher Order Logics: TPHOLs 2000, volume 1869 of LNCS, pages 1-16. Springer-Verlag, 2000.
2. G. Barthe and O. Pons. Type Isomorphisms and Proof Reuse in Dependent Type Theory. In F. Honsell and M. Miculan, editors, FOSSACS'01, volume 2030, pages 57-71. LNCS, Springer-Verlag, 2001.
3. Y. Bertot and P. Casteran. Le Coq'Art. To appear, 2003.
4. J. Chrzaszcz. Implementation of Modules in the Coq System. Draft, February 2003.
5. Coq development team, INRIA and LRI. The Coq Proof Assistant Reference Manual, May 2002. Version 7.3.
6. C. Cornes and D. Terrasse. Automatizing Inversion of Inductive Predicates in Coq. In TYPES'95, volume 1158. LNCS, Springer-Verlag, 1995.
7. D. Delahaye and M. Mayero. Field: une procédure de décision pour les nombres réels en Coq. In P. Castéran, editor, Journées Francophones des Langages Applicatifs, Pontarlier. INRIA, Janvier 2001.
8. P. Dybjer. Inductive Families. Formal Aspects of Computing, 6(4):440-465, 1994.
9. P. Dybjer. A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory. Journal of Symbolic Logic, 65(2), 2000.
10. M. Hofmann. Conservativity of Equality Reflection over Intensional Type Theory. In BRA Workshop on Types for Proofs and Programs (TYPES'95), volume 1158, pages 153-165. Springer-Verlag LNCS, 1996.
11. Z. Luo and S. Soloviev. Dependent Coercions. In 8th Inter. Conf. on Category Theory in Computer Science (CTCS'99), volume 29 of ENTCS, pages 23-34, Edinburgh, Scotland, 1999. Elsevier.
12. N. Magaud and Y. Bertot. Changing Data Structures in Type Theory:A Study of Natural Numbers. In International Workshop on Types for Proofs and Programs, volume 2277 of LNCS, pages 181-196. Springer-Verlag, 2000.
13. C. McBride and J. McKinna. The View from the Left. Journal of Functional Programming, Special Issue: Dependent Type Theory meets Programming Practice, 2002. submitted.
14. A. Miquel. Axiom ∀P,Q : Prop. (P ↔ Q)→(P==Q) is safe. Communication in the coq-club list, November 2002.
15. C. Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In M. Bezem and J.-F. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of LNCS, 1993. LIP research report 92-49.
16. A. Saibi. Typing Algorithm in Type Theory with Inheritance. In POPL'97. ACM, 1997.
17. P. Wadler. Views: A Way for Pattern Matching to Cohabit with Data Abstraction. In POPL'87. ACM, 1987.