Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:Subtyping Dependent Types
Authors: David Aspinall ; Adriana Compagnoni
Date:Sep 2001
Publication Title:Theoretical Computer Science
Publication Type:Journal Article Publication Status:Published
Volume No:# 266(1-2) Page Nos:273-309
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-sub, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking.
Links To Paper
No links available
Bibtex format
author = { David Aspinall and Adriana Compagnoni },
title = {Subtyping Dependent Types},
journal = {Theoretical Computer Science},
publisher = {Elsevier},
year = 2001,
month = {Sep},
volume = {# 266(1-2)},
pages = {273-309},
doi = {10.1016/S0304-3975(00)00175-4},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh