Higher-order subtyping
From MaRDI portal
Publication:1392282
DOI10.1016/S0304-3975(96)00096-5zbMath0903.68020MaRDI QIDQ1392282
Martin Steffen, Benjamin C. Pierce
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68N15: Theory of programming languages
Related Items
A Tutorial on Type-Based Termination, Higher-order subtyping and its decidability, Order-sorted inductive types, Typed operational semantics for higher-order subtyping., Basic theory of \(F\)-bounded quantification., Comparing object encodings., Full Abstraction in a Subtyped pi-Calculus with Linear Types, Polarised subtyping for sized types, Syntactic Metatheory of Higher-Order Subtyping, Type-Based Termination with Sized Products, Coherence of subsumption for monadic types
Cites Work
- Divergence of \(F_{\leq}\) type checking
- A modest model of records, inheritance, and bounded quantification
- A semantics of multiple inheritance
- Bounded existentials and minimal typing
- The lambda calculus, its syntax and semantics
- Inheritance as implicit coercion
- An extension of system \(F\) with subtyping
- Bounded quantification is undecidable
- A new type assignment for λ-terms
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Subtyping + extensionality: Confluence of βηtop reduction in F≤
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item