An extension of system \(F\) with subtyping
From MaRDI portal
Publication:1322473
DOI10.1006/inco.1994.1013zbMath0805.03008OpenAlexW2165657834WikidataQ56518661 ScholiaQ56518661MaRDI QIDQ1322473
Luca Cardelli, John C. Mitchell, Andrej Scedrov, Simone Martini
Publication date: 9 June 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1013
Related Items (25)
Higher-order pattern anti-unification in linear time ⋮ The Essence of Dependent Object Types ⋮ Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping ⋮ Termination of system \(F\)-bounded: A complete proof ⋮ Bounded existentials and minimal typing ⋮ Subtyping + extensionality: Confluence of βηtop reduction in F≤ ⋮ An imperative object calculus ⋮ Higher-order subtyping ⋮ Formal metatheory of programming languages in the Matita interactive theorem prover ⋮ Disjoint Polymorphism ⋮ Contracts made manifest ⋮ Divergence of \(F_{\leq}\) type checking ⋮ Ott: Effective tool support for the working semanticist ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ Coercion completion and conservativity in coercive subtyping ⋮ Unnamed Item ⋮ Game Semantics for Bounded Polymorphism ⋮ Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions ⋮ Basic theory of \(F\)-bounded quantification. ⋮ A sequent calculus for subtyping polymorphic types ⋮ Type destructors ⋮ Assigning types to processes ⋮ Foundations for virtual types ⋮ Free Theorems and Runtime Type Representations ⋮ Formal parametric polymorphism
This page was built for publication: An extension of system \(F\) with subtyping
