Subtyping dependent types

David Aspinall, Adriana B. Compagnoni

Research output: Contribution to journalArticlepeer-review


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 some important properties of the new system Full-size image (<1 K), including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking.
Original languageEnglish
Pages (from-to)273-309
Number of pages37
JournalTheoretical Computer Science
Issue number1-2
Publication statusPublished - 6 Sep 2001


Dive into the research topics of 'Subtyping dependent types'. Together they form a unique fingerprint.

Cite this