Higher-order subtyping
type: Item
instance of: scholarly article
title: Higher-order subtyping
zbMATH Open document ID: 0903.68020
DOI: 10.1016/S0304-3975(96)00096-5
author: Martin Steffen
author: Benjamin C. Pierce
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1178870
zbMATH Keywords: lambda-calculus
zbMATH Keywords: type systems
zbMATH Keywords: subtyping
zbMATH Keywords: polymorphism
zbMATH Keywords: bounded quantification
zbMATH Keywords: typechecking
MaRDI profile type: Publication
cites work: Q4715213
cites work: The lambda calculus, its syntax and semantics
cites work: Inheritance as implicit coercion
cites work: A modest model of records, inheritance, and bounded quantification
cites work: A semantics of multiple inheritance
cites work: An extension of system \(F\) with subtyping
cites work: Q4474829
cites work: Q3837264
cites work: Q4855348
cites work: A new type assignment for λ-terms
cites work: Subtyping + extensionality: Confluence of βηtop reduction in F≤
cites work: Coherence of subsumption, minimum typing and type-checking in F ≤
cites work: Q4281471
cites work: Divergence of \(F_{\leq}\) type checking
cites work: Bounded existentials and minimal typing
cites work: Q3994895
cites work: Q4301602
cites work: Q3997125
cites work: Q4281484
cites work: Bounded quantification is undecidable
cites work: Q4068054
cites work: Q4501161
Recommended article: Foundations for the implementation of higher-order subtyping
Recommended article: Higher-order subtyping and its decidability
Recommended article: Q4738349
Recommended article: Higher-order superposition for dependent types
Recommended article: Subtyping dependent types
Recommended article: Type inference with subtypes
Recommended article: Theoretical Computer Science
Recommended article: Logic of subtyping
description: scientific article; zbMATH DE number 1178870