Subtyping dependent types

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 /spl 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 /spl lambda/P/sub /spl les//, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking.

[1]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[2]  F. Honsell,et al.  A Framework for De ning LogicsRobert Harper , 1987 .

[3]  David Aspinall,et al.  Type systems for modular programs and specifications , 1997 .

[4]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[5]  Thierry Coquand,et al.  Pattern Matching with Dependent Types , 1992 .

[6]  Benjamin C. Pierce,et al.  Higher-Order Subtyping , 1994, Theor. Comput. Sci..

[7]  Giuseppe Longo,et al.  A Logic of Subtyping (Extended Abstract) , 1995, LICS 1995.

[8]  Thierry Coquand,et al.  Inheritance as Implicit Coercion , 1991, Inf. Comput..

[9]  B. Pierce.  Programming with intersection types and bounded polymorphism , 1992 .

[10]  Benjamin C. Pierce,et al.  Bounded quantification is undecidable , 1992, POPL '92.

[11]  Luca Cardelli,et al.  Structural subtyping and the notion of power type , 1988, POPL '88.

[12]  Adriana B. Compagnoni,et al.  Higher-order subtyping with intersection types , 1995 .

[13]  Giuseppe Longo,et al.  A logic of subtyping , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[14]  Luca Cardelli,et al.  Typechecking Dependent Types and Subtypes , 1986, Foundations of Logic and Functional Programming.

[15]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[16]  Benjamin C. Pierce,et al.  Simple type-theoretic foundations for object-oriented programming , 1994, Journal of Functional Programming.

[17]  Giorgio Ghelli,et al.  Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..

[18]  Ian A. Mason.  Hoare's Logic in the LF , 1987 .

[19]  David Aspinall,et al.  Subtyping with Singleton Types , 1994, CSL.

[20]  Giorgio Ghelli,et al.  Coherence of Subsumption , 1990, CAAP.