Coercive subtyping for the calculus of constructions

ACM SIGPLAN Notices

Volumn 38, Issue 1, 2003, Pages 150-159

  Chen, Gang ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Calculus of constructions; Coercion; Semantics of coercions; Subtyping; Transitivity elimination

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EQUIVALENCE CLASSES; OBJECT ORIENTED PROGRAMMING; SEMANTICS; THEOREM PROVING;

CALCULUS OF CONSTRUCTIONS; COERCIVE SUBTYPING; TRANSITIVITY ELIMINATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442339034     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/640128.604145     Document Type: Article

References (25)

1. D. Aspinall and A. Compagnoni. Subtyping dependent types. In Proc. 11th Annual Symposium on Logic in Computer Science, IEEE, pages 86-97, 1996.
2. A. Bailey. Lego with implicit coercions, 1996. draft.
3. G. Barthe. Implicit coercions in type systems. In S. Berardi and M. Coppo, editors, Proceedings of Types'95, LNCS 1128, pp 1-15., 1995.
4. V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172-221, July 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 Proc. 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(4):471-522, December 1985.
8. G. Castagna. Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science. Birkäuser, Boston, 1997. ISBN 3-7643-3905-5.
9. G. Chen. Dependent type system with subtyping. Technical Report LIENS-96-27, Laboratoire d'Informatique, Ecole Normale Supérieure - Paris, 12 1996. Revised version in Journal of Computer Science and Technology, vol. 14, no. 1 (1999).
10. G. Chen. Subtyping calculus of construction, extended abstract. In The 22nd International Symposium on Mathematical Foundation of Computer Science, volume 1295. Springer-Verlag LNCS, August 1997. Bratislava, Slovakia.
11. G. Chen. Subtyping, type conversions and elimination of transitivity. PhD thesis, Université Paris 7, December 1998.
12. ω is decidable. Technical Report ECS-LFCS-94-281, LFCS University of Edinburgh, January 1994, and in CSL'94.
13. ≤. Mathematical Structures in Computer Science, 2(1):55-91, 1992.
14. H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, Netherlands, 1993.
15. 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, September 1997. Durham, U.K.
16. M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, CMU, May 1997. CMU-CS-97-122.
17. G. Longo, K. Milsted, and S. Soloviev. A Logic of Subtyping, extended abstract. In Logic in Computer Science (LICS), pages 292-300. IEEE, 1995. San Diego, June 1995.
18. G. Longo, K. Milsted and S. Soloviev. Coherence and transitivity of subtyping as entailment. 1998. Journal of Logic and Computation., vol. 10: 4, pp. 493-526, August 2000.
19. Y. Luo and Z. Luo. Coherence and transitivity of subtyping in coercive subtyping. In Proc. of the 8th Inter. Conf. on Logic for Programming, Arificial Intelligence and Reasoning (LPAR'01), Havana, Cuba., number 2250 in LNAI, 2001.
20. 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 LNCS, 1996.
21. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(97-13), 1997.
22. J. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211-249, 1988.
23. 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, vol. 176, no. 1-2, pp. 235-282, 1997 (with a corrigendum in TCS vol. 184 (1997), p. 247).
24. A. Saibi. Typing algorithm in type theory with inheritance. In the 24th Annual SIGPLAN-SIGACT Symposium on principles of Programming Languages, January 1997. Paris, France.
25. S. Soloviev and Z. Luo. Coercion completion and conservativity in coercive subtyping. Annals of Pure and Applied Logic, 113(1-3):297-322, 2002.