Subtyping dependent types (Summary)

David Aspinall, Adriana Compagnoni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 λP⩽, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking
Original languageEnglish
Title of host publicationLICS '96. Proceedings., Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages10
ISBN (Print)0-8186-7463-6
Publication statusPublished - 1996


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

Cite this