Proof Reuse with Extended Inductive Types

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

Volumn 3223, Issue , 2004, Pages 50-65

  Boite, Olivier ^a  

^a Laboratoire CEDRIC   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; REUSABILITY; SPECIFICATIONS;

INDUCTIVE-TYPE; LANGUAGE DESIGN; PROOF ASSISTANT; REUSE MECHANISM; TYPE THEORY;

THEOREM PROVING;

EID: 34247875090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30142-4_4     Document Type: Article

References (27)

1. [Bar03] B. Barras et al. The Coq Proof Assistant, Reference Manual (v7.4). INRIA Rocquencourt, 2003.
2. [BC02] G. Barthe and P. Courtieu. Efficient reasoning about executable specifications in coq. In C. Muñoz and S. Tahar, editors, Proceedings of TPHOL'02, volume 2410 of LNCS, pages 31-46. Springer-Verlag, 2002.
3. [BD01] O. Boite and C. Dubois. Proving Type Soundness of a Simply Typed ML-like Language with References. In R. Boulton and P. Jackson, editors, Supplemental Proceedings of TPHOL'01, Informatics Research Report EDI-INF-RR-0046 of University of Edinburgh, pages 69-84, 2001.
4. [BDHdS01] G. Barthe, G. Dufay, M. Huisman, and S. Melo de Sousa. Jakarta: a toolset for reasoning about javacard. In I. Attali and T. Jensen, editors, Proceedings of SMART'01, volume 2140 of LNCS, pages 2-18, 2001.
5. [BP01] G. Barthe and O. Pons. Type Isomorphisms and Proof Reuse in Dependent Type Theory. In P. Honsell and M. Miculan, editors, Proceedings of FOSSACS'01, volume 2030 of LNCS, pages 57-71. Springer-Verlag, 2001.
6. [BR00] G. Barthe and F. van Raamsdonk. Constructor Subtyping in the Calculus of Inductive Constructions. In J. Tuyrin, editor, Proceedings of FOSSACS'00, volume 1784 of LNCS, pages 17-34. Springer-Verlag, 2000.
7. +86] R. L. Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, NJ, 1986.
8. [Cal00] P. Callaghan. Coherence checking of coercions in plastic. In Workshop on Subtyping and Dependent Types in Programming, Ponte de Lima, July 2000.
9. [Del00] D. Delahaye. A Tactic Language for the System Coq. In Proceedings of Logic for Programming and Automated Reasoning (LPAR), Reunion Island, volume 1955 of LNCS, pages 85-95. Springer-Verlag, 2000.
10. [Dub00] C. Dubois. Proving ML Type Soundness Within Coq. In Proceedings of TPHOL'00, volume 1869 of LNCS, pages 126-144, Portland, Oregon, USA, 2000. Springer-Verlag.
11. [Gay01] S. J. Gay. A Framework for the Formalisation of Pi Calculus Type Systems. In R.J. Boulton and P.B. Jackson, editors, 14th International Conference, TPHOL'01, volume 2152 of LNCS, pages 217-232, Edinburgh, Scotland, UK, September 2001. Springer-Verlag.
12. [GM93] M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL A theorem proving environment for higher order logic. Cambridge University Press, 1993.
13. [LP92] Z. Luo and R. Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, The King's Buildings, Edinburgh EH9 3JZ, 1992.
14. [LP99] M. Y. Levin and B. C. Pierce. Tinkertype: A language for playing with formal systems. Technical Report MS-CIS-99-19, Dept of CIS, University of Pennsylvania, July 1999.
15. [Luo96] Z. Luo. Coercive subtyping in type theory. In CSL, pages 276-296, 1996.
16. [Mag94] L. Magnusson. The Implementation of ALF - α Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Chalmers University of Technology - Göteborg University, 1994.
17. [Mag03] N. Magaud. Changing data representation within the coq system. In Proceedings of TPHOL'03, volume 2758 of LNCS, pages 87-102, Roma, Italy, September 2003. Springer-Verlag.
18. [Muñ96] C. Muñoz. Proof representation in type theory: State of the art. In Proc. XXII Latinamerican Conference of Informatics CLEI Panel 96, Santafé de Bogota, Colombia, June 1996.
19. [NOP00] T. Nipkow, D. von Oheimb, and C. Pusch. Java: Embedding a Programming Language in a Theorem Prover. In F.L. Bauer and R. Steinbruggen, editors, Foundations of Secure Computation. IOS Press, 2000.
20. [PBR98] O. Pons, Y. Bertot, and L. Rideau. Notions of dependency in proof assistants. In Electronic Proceedings of User Interfaces for Theorem Provers, Sophia-Antipolis, France, 1998.
21. [Pie00] B. C. Pierce. Types and Programming Languages. MIT Press, 2000.
22. [PM96] C. Paulin-Mohring. Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Université Lyon I, December 1996.
23. [Pol97] E. Poll. Subtyping and Inheritance for Inductive Types. In Proceedings of TYPES'97 Workshop on Subtyping, inheritance and modular development of proofs, September 1997.
24. [Pon99] O. Pons. Conception et réalisation d'outils d'aide au développement de grosses théories dans les systèmes de preuves interactifs. PhD thesis, Conservatoire National des Arts et Métiers, 1999.
25. [Sym99] D. Syme. Proving Java Type Sound. In In Jim Alves-Foss, editor, Formal Syntax and Semantics of Java., volume 1523 of LNCS. Springer-Verlag, 1999.
26. [Van97] M. VanInwegen. Towards Type Preservation in Core SML. Technical report, Cambridge University, 1997.
27. [Wer94] B. Werner. Une théorie deś constructions inductives. PhD thesis, Université Paris 7, 1994.