Gang Chen
ABSTRACT
We present a coercive subtyping system for the calculus of constructions. The proposed system λCCOover≤ is obtained essentially by adding coercions and η-conversion to λC≤[10], which is a subtyping extension to the calculus of constructions without coercions. Following [17, 18], the coercive subtyping c : A η B is understood as a special case of typing in arrow type c : A → B such that the term c behaves like an identity function. We prove that, with respect to this semantic interpretation, the proposed coercive subtyping system is sound and complete, and that this completeness leads to transitivity elimination (transitivity rule is admissible). In addition, we establish the equivalence between λCCOover≤ and CCßη, this fact implies that λCCOover≤ has confluence, subject reduction and strong normalization. We propose a formalization of coercion inference problem and present a sound and complete coercion inference algorithm.
- D. Aspinall and A. Compagnoni. Subtyping dependent types. In Proc. 11th Annual Synposium on Logic in Computer Science, IEEE, pages 86--97, 1996.]] Google Scholar
Digital Library
- A. Bailey. Lego with implicit coercions, 1996. draft.]]Google Scholar
- G. Barthe. Implicit coercions in type systems. In S. Berardi and M. Coppo, editors, Proceedings of Types'95, LNCS 1128, pp 1--15., 1995.]] Google ScholarDigital Library
- V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172--221, July 1991.]] Google ScholarDigital Library
- K. B. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification. Information and Computation, 87:196--240, 1990.]] Google ScholarDigital Library
- L. Cardelli. Typechecking dependent types and subtypes. In Proc. of the Workshop on Foundations of Logic and Functional Programming, December 1987.]] Google ScholarDigital Library
- L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471--522, December 1985.]] Google ScholarDigital Library
- G. Castagna. Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science. Birkäuser, Boston, 1997. ISBN 3-7643-3905-5.]] Google ScholarDigital Library
- 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).]]Google Scholar
- 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.]] Google ScholarDigital Library
- G. Chen. Subtyping, type conversions and elimination of transitivity. PhD thesis, Université Paris 7, December 1998.]]Google Scholar
- A. B. Compagnoni. Subtyping in Fωover∧ is decidable. Technical Report ECS-LFCS-94-281, LFCS University of Edinburgh, January 1994. and in CSL'94.]]Google Scholar
- P.-L. Curien and G. Ghelli. Coherence of subsumption, minimum typing and the type checking in F≤. Mathematical Structures in Computer Science, 2(1):55--91, 1992.]]Google ScholarCross Ref
- H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, Netherlands, 1993.]]Google Scholar
- 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.]]Google Scholar
- M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, CMU, May 1997. CMU-CS-97-122.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(97--13), 1997.]]Google Scholar
- J. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211--249, 1988.]] Google ScholarDigital Library
- 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).]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- S. Soloviev and Z. Luo. Coercion completion and conservativity in coercive subtyping. Annalsof Pure and Applied Logic, 113(1-3):297--322, 2002.]]Google ScholarCross Ref
Index Terms
- Coercive subtyping for the calculus of constructions
Recommendations
Coercive subtyping for the calculus of constructions
We present a coercive subtyping system for the calculus of constructions. The proposed system λCCOover≤ is obtained essentially by adding coercions and η-conversion to λC≤[10], which is a subtyping extension to the calculus of constructions without ...
Soundness of Coercion in the Calculus of Constructions
A coercive subtyping system for the Calculus of Constructions is presented. The proposed system λC≤co is obtained essentially by adding coercions and η-conversion to λC≤, which is a subtyping extension to the Calculus of Constructions without coercions. ...
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via ...
Comments