Subtyping dependent types

Authors:
David Aspinall;Adriana Compagnoni
Affiliations:
Univ. of Edinburgh, Edinburgh, UK;Stevens Institute of Technology, Hoboken, NJ
Venue:
Theoretical Computer Science
Year:
2001

Citing 15
Cited 12

The calculus of constructions

Information and Computation - Semantics of Data Types
Typechecking dependent types and subtypes

Lecture notes in computer science on Foundations of logic and functional programming
Structural subtyping and the notion of power type

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inheritance as implicit coercion

Information and Computation
A framework for defining logics

Journal of the ACM (JACM)
Bounded quantification is undecidable

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with intersection types and bounded polymorphism

Programming with intersection types and bounded polymorphism
Toward formal development of programs from algebraic specifications: parameterisation revisited

Acta Informatica
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Using typed lambda calculus to implement formal systems on a machine

Journal of Automated Reasoning
Subtyping Calculus of Construction (Extended Abstract)

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Higher-Order Subtyping

PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Subtyping with Singleton Types

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A logic of subtyping

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Subtyping Dependent Types

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Types and Effects for Asymmetric Cryptographic Protocols

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Typed operational semantics for higher-order subtyping

Information and Computation
Higher-order subtyping and its decidability

Information and Computation
Anti-symmetry of higher-order subtyping and equality by subtyping

Mathematical Structures in Computer Science
Types and effects for asymmetric cryptographic protocols

Journal of Computer Security - Special issue on CSFW15
A Bidirectional Refinement Type System for LF

Electronic Notes in Theoretical Computer Science (ENTCS)
Generics of a higher kind

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Coherence of subsumption for monadic types

Journal of Functional Programming
Refinement types for secure implementations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic contracts

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
On the role of type decorations in the calculus of inductive constructions

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Coercive subtyping: Theory and implementation

Information and Computation

Quantified Score

Hi-index	5.23

Visualization

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 some important properties of the new system λP6=, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking. Copyright 2001 Elsevier Science B.V.