Soundness of coercion in the Calculus of Constructions

Journal of Logic and Computation

Volumn 14, Issue 3, 2004, Pages 405-427

  Chen, Gang ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Calculus of constructions; Coercion; Proof reuse; Subtyping

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; LINEARIZATION; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

COERCIVE SUBTYPING; NONTRIVIAL SUBTYPING SYSTEM; NORMALIZATION; STRUCTURAL PROPERTIES;

COMPUTER SCIENCE;

EID: 3042719597     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.3.405     Document Type: Article

References (29)

1. D. Aspinall and A. Compagnoni. Subtyping dependent types. In Proceedings of the Eleventh Annual Synposium on Logic in Computer Science, IEEE, pp. 86-97, 1996.
2. A. Bailey. Lego with implicit coercions, 1996. draft.
3. G. Barthe. Implicit coercions in type systems. In Proceedings of Types'95, S. Berardi and M. Coppo, eds, pp.1-15, volume 1128 of Lecture Notes in Computer Science. Springer, 1995.
4. V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93, 172-221, 1991.
5. K. B. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification. Information and Computation, 87, 196-240, 1990.
6. L. Cardelli. Typechecking dependent types and subtypes. In Proceedings of the Workshop on Foundations of Logic and Functional Programming, December 1987.
7. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17, 471-522, 1985.
8. G. Castagna. Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science. Birkäuser, Boston, 1997.
9. G. Chen. Subtyping calculus of construction (extended abstract). In The Twenty-second International Symposium on Mathematical Foundation of Computer Science, Bratislava, Slovakia, volume 1295 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
10. G. Chen. Subtyping, Type conversions and Elimination of Transitivity. PhD thesis, Université Paris 7, 1998.
11. G. Chen. Coercive subtyping for the calculus of construction (extended abstract). In The Thirtieth Annual SIGPLAN-SIGACT Symposium of Principle and Practice of Programming Language (POPL), New Orleans, USA, 2003.
12. A. B. Compagnoni. Subtyping in F∧ω is decidable. Technical Report ECS-LFCS-94-281, LFCS University of Edinburgh, January 1994. Also in CSL'94.
13. ≤. Mathematical Structures in Computer Science, 2, 55-91, 1992.
14. H. Geuvers. The Church-Rosser property for βη-reduction in typed lambda calculi. In Proceedings of the Seventh Annual Symposium on Logic in Computer Science, Santa Cruz, CA, pp. 453-460, IEEE, 1992.
15. H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, Netherlands, 1993.
16. A. Jones, Z. Luo, and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. In Workshop on Subtyping, Inheritance and Modular Development of Proofs, 1997. Durham, U.K. A revised version in [17].
17. A. Jones, Z. Luo, and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. In Types for proofs and programs, E. Gimenez and C. Paulin-Mohring, eds, pp 173-196, volume 1512 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
18. G. Longo, K. Milsted, and S. Soloviev. A logic of subtyping, extended abstract. In Logic in Computer Science (LICS), San Diego, pp. 292-300. IEEE, 1995.
19. G. Longo, K. Milsted, and S. Soloviev. Coherence and transitivity of subtyping as entailment. Journal of Logic and Computation, 9, 493-526, 1999.
20. Y. Luo and Z. Luo. Coherence and transitivity of subtyping in coercive subtyping. In Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAK'01), Havana, Cuba, volume 2250 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2001.
21. Z. Luo. Coercive subtyping in type theory. In CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht, volume 1258 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
22. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9, 105-130, 1999.
23. J.C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76, 211-249, 1988.
24. F. Pfenning. Foundations of programming languages, course notes, 2002.
25. B. Pierce and M. Steffen. Higher-order subtyping. In IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), 1994. Full version in Theoretical Computer Science, 176, 235-282, 1997 (with a corrigendum in Theoretical Computer Science, 184, 247, 1997.
26. B. Pierce and M. Steffen. Higher-order subtyping. In IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), 1994. Full version in Theoretical Computer Science, 176, 235-282, 1997 (with a corrigendum in Theoretical Computer Science, 184, 247, 1997.
27. A. Saibi. typing algorithm in type theory with inheritance. In The Twenty-fourth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France, 1997.
28. S. Soloviev and Z. Luo. Coercion completion and conservativity in coercive subtyping. Annals of Pure and Applied Logic, 113, 297-322, 2002.
29. M. Wand, P. O'Keefe, and J. Palsberg. Strong normalization with non-structural subtyping. Mathematical Structures in Computer Science, 5, 419-430, 1995.