Constructor subtyping in the calculus of inductive constructions

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

Volumn 1784 LNCS, Issue , 2000, Pages 17-34

  Barthe, Gilles ^a,b   Van Raamsdonk, Femke ^c,d  

^a INRIA   (France)

^b UNIVERSITY OF MINHO   (Portugal)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

^d CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; SEMANTICS; THEOREM PROVING; COMPUTATION THEORY;

CALCULUS OF INDUCTIVE CONSTRUCTIONS; DEPENDENT TYPES; INDUCTIVE DEFINITIONS; INDUCTIVE-TYPE; NATURAL SEMANTICS; PROOF ASSISTANT; PROOF DEVELOPMENT; TYPE SYSTEMS;

CALCULATIONS;

EID: 84878642534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_2     Document Type: Conference Paper

References (36)

1. P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of mathematical logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 739-782. North-Holland, 1977.
2. D. Aspinall and A. Compagnoni. Subtyping dependent types. In Proceedings of LICS'96, pages 86-97. IEEE Computer Society Press, 1996.
3. B. Barras. Auto-validation d'un système de preuves avec familles inductives. PhD thesis, Université Paris 7, 1999.
4. B. Barras et al. The Coq Proof Assistant User's Guide. Version 6.2, May 1998.
5. G. Barthe. Implicit coercions in type systems. In S. Berardi and M. Coppo, editors, Proceedings of TYPES'95, volume 1158 of Lecture Notes in Computer Science, pages 16-35. Springer-Verlag, 1996.
6. G. Barthe. Expanding the cube. In W. Thomas, editor, Proceedings of FOSSACS'99, volume 1578 of Lecture Notes in Computer Science, pages 90-103. Springer-Verlag, 1999.
7. G. Barthe. Order-sorted inductive types. Information and Computation, 149(1): 42-76, February 1999. (Pubitemid 129608824)
8. G. Barthe and M.J. Frade. Constructor subtyping. In D. Swiestra, editor, Proceedings of ESOP'99, volume 1576 of Lecture Notes in Computer Science, pages 109-127. Springer-Verlag, 1999.
9. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. ACM Computing Surveys, 17(4): 471-522, December 1985. (Pubitemid 16612686)
10. G. Castagna and G. Chen. Dependent types with subtyping and late-bound overloading. Information and Computation, 1999. To appear.
11. G. Chen. Subtyping calculus of constructions. In I. Prívara and P. Ruzicka, editors, Proceedings of M FCS' 97, volume 1295 of Lecture Notes in Computer Science, pages 189-198. Springer-Verlag, 1997.
12. T. Coquand. Metamathematical investigations of a calculus of constructions. In P. Odifreddi, editor, Logic and Computer Science, pages 91-122. Academic Press, 1990.
13. T. Coquand. An algorithm for type-checking dependent types. Science of Computer Programming, 26(1-3):167-177, May 1996. (Pubitemid 126374243)
14. H. Geuvers. A short and flexible proof of strong normalisation for the Calculus of Constructions. In P. Dybjer, B. Nordström, and J. Smith, editors, Proceedings of TYPES'94, volume 996 of Lecture Notes in Computer Science, pages 14-38. Springer-Verlag, 1995.
15. H. Geuvers and M.J. Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1(2): 155-189, April 1991.
16. N. Ghani. Eta-expansions in dependent type theory - the calculus of constructions. In P. de Groote and J. Hindley, editors, Proceedings of TLCA'97, volume 1210 of Lecture Notes in Computer Science, pages 164-180. Springer-Verlag, 1997. (Pubitemid 127046878)
17. E. Giménez. Un calcul de constructions infinies et son application à la vérification de systèmes communicants. PhD thesis, Ecole Normale Superieure de Lyon, 1996.
18. E. Giménez. Structural recursive definitions in Type Theory. In K.G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 397-408. Springer-Verlag, 1998. (Pubitemid 128111132)
19. E. Giménez. A tutorial on recursive types in coq. Technical Report RT-0221, INRIA, 1998.
20. J. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2): 216-273, 1992.
21. M.J.C. Gordon and T.F. Melham, editors. Introduction to HOL: A theorem proving environment for higher-order logic. Cambridge University Press, 1993.
22. C.A. Gunter and J.C. Mitchell. Theoretical A spects of O bject-Oriented Programming: Types, Semantics and Language Design. The MIT Press, 1994.
23. G. Kahn. Natural semantics. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pages 22-39. Springer-Verlag, 1987.
24. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9: 105-130, February 1999.
25. Z. Luo and R. Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, University of Edinburgh, May 1992.
26. J. Nordlander. Pragmatic subtyping in polymorphic languages. In Proceedings of ICFP'98. ACM Press, 1998.
27. J. Norlander. Reactive Objects and Functional Programming. PhD thesis, Chalmers Tekniska Högskola, 1999.
28. L. Paulson. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
29. F. Pfenning. Refinement types for logical frameworks. In H. Geuvers, editor, Informal Proceedings of TYPES' 93, pages 285-299, 1993.
30. E. Poll. Subtyping and Inheritance for Inductive Types. In Proceedings of TYPES'97 Workshop on Subtyping, inheritance and modular development of proofs, Durham, UK, 1997.
31. E. Poll. Subtyping and Inheritance for Categorical Datatypes. In Proceedings of Theories of Types and Proofs (TTP) - Kyoto, RIMS Lecture Notes 1023, pages 112-125. Kyoto University Research Insitute for Mathematical Sciences, 1998.
32. 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.
33. M. Steffen. Polarized Higher-order Subtyping. PhD thesis, Department of Computer Science, University of Erlangen, 1997.
34. J. Terlouw. Strong normalization in type systems: a model theoretic approach. Annals of Pure and Applied Logic, 73(1): 53-78, May 1995.
35. B. Werner. M éta-théorie du Calcul des Constructions Inductives. PhD thesis, Université Paris 7, 1994.
36. J. Zwanenburg. Pure type systems with subtyping. In J.-Y. Girard, editor, Proceedings of T LCA' 99, volume 1581 of Lecture Notes in Computer Science, pages 381-396. Springer-Verlag, 1999.