Coercion completion and conservativity in coercive subtyping

Abstract Coercive subtyping offers a general approach to subtyping and inheritance by introducing a simple abbreviational mechanism to constructive type theories. In this paper, we study coercion completion in coercive subtyping and prove that the formal extension with coercive subtyping of a type theory such as Martin–Lof's type theory and UTT is a conservative extension. The importance of coherence conditions for the conservativity result is also discussed.

[1]  Luca Cardelli,et al.  An Extension of System F with Subtyping , 1994, Inf. Comput..

[2]  Amokrane Saïbi Typing algorithm in type theory with inheritance , 1997, POPL '97.

[3]  Thierry Coquand,et al.  Inheritance and explicit coercion , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  Luca Cardelli,et al.  An Extension of System F with Subtyping , 1991, TACS.

[5]  Zhaohui Luo,et al.  Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language , 1997, LACL.

[6]  Thierry Coquand,et al.  Inductively defined types , 1988, Conference on Computer Logic.

[7]  Gang Chen Sous-typage, conversion de types et elimination de la transitivite , 1998 .

[8]  Zhaohui Luo,et al.  Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.

[9]  Zhaohui Luo Coercive Subtyping and Lexical Semantics , 1998 .

[10]  Zhaohui Luo,et al.  Coercive Subtyping , 1995 .

[11]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[12]  Benjamin C. Pierce,et al.  Higher-Order Subtyping , 1994, Theor. Comput. Sci..

[13]  P. Dybjer Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[14]  Giuseppe Longo,et al.  A logic of subtyping , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[15]  Bengt Nordström,et al.  Programming in Martin-Lo¨f's type theory: an introduction , 1990 .

[16]  Zhaohui Luo,et al.  Coercive Subtyping in Type Theory , 1996, CSL.

[17]  Jerzy Tiuryn,et al.  Equational Axiomatization of Bicoercibility for Polymorphic Types , 1995, FSTTCS.