| | |
Summary: Subtyping Dependent Types
David Aspinall
LFCS, Division of Informatics
University of Edinburgh
King's Buildings
Edinburgh EH9 3JZ, U. K.
Adriana Compagnoni
Department of Computer Science
Stevens Institute of Technology
Castle Point on Hudson
Hoboken, NJ 07030, U. S. A.
February 8, 2000
Abstract
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 P, which is an abstract version of the type system of the
Edinburgh Logical Framework LF. By using an equivalent formulation, we establish
|
