Article contents
Strong normalization with non-structural subtyping
Published online by Cambridge University Press: 04 March 2009
Abstract
We study a type system with a notion of subtyping that involves a largest type ⊤, a smallest type ⊥, atomic coercions between base types, and the usual ordering of function types. We prove that any λ-term typable in this system is strongly normalizing, which solves an open problem of Thatte. We also prove that the fragment without ⊥ types has strictly fewer terms. This demonstrates that ⊥ adds power to a type system.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1995
References
- 4
- Cited by