1. Transitivity in coercive subtyping
- Author
-
Luo, Zhaohui and Luo, Yong
- Subjects
- *
COMPUTATIONAL complexity , *MACHINE theory , *TYPE theory , *MATHEMATICAL logic - Abstract
Abstract: Coercive subtyping is a general approach to abbreviation and subtyping in dependent type theories with inductive types. Coherence and admissibility of transitivity are important both for understanding of the framework and for its correct implementation. In this paper, we study the issue of transitivity in the context of subtyping for parameterised inductive types. In particular, we propose and study the notion of weak transitivity and show that, for a large class of parameterised inductive types, the natural subtyping rules are coherent and weak transitivity is admissible in an intensional type theory. A possible extension of type theory with certain extensional computation rules is also discussed for achieving admissibility of transitivity in general. [Copyright &y& Elsevier]
- Published
- 2005
- Full Text
- View/download PDF