The need for subtyping in type-systems with dependent types has been realized for some years. But it is hard to prove that systems combining the two features have fundamental properties such as subject reduction. Here we investigate a subtyping extension of the system lambda P, which is an abstract version of the type system of the Edinburgh Logical Framework LF. By using an equivalent formulation, we establish some important properties of the new system lambda P<=, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking.
This is a expanded version of the paper which appeared under the same title in Proc. 11th Annual Symposium on Logic in Computer Science, IEEE 1996.ECS-LFCS-97-370 (updated June 2000).
This report is available in the following formats: