Coercive subtyping

Z Luo
1999 Journal of Logic and Computation  
We propose and study coercive subtyping, a formal extension with subtyping of dependent type theories such as Martin-L of's type theory 38] and the type theory UTT 30]. In this approach, subtyping with speci ed implicit coercions is treated as a feature at the level of the logical framework; in particular, the meaning of an object being in a supertype is given by coercive de nition rules for the de nitional equality. This provides a conceptually simple and uniform framework to understand
more » ... ng and inheritance relations in type theories with sophisticated type structures such as inductive types and universes. The use of coercive subtyping in formal development and in reasoning about subsets of objects is discussed in the context of computer-assisted formal reasoning.
doi:10.1093/logcom/9.1.105 fatcat:dv2xyk5nzbf3dk5od6wuwsdovi