An extension of system \(F\) with subtyping
From MaRDI portal
Publication:1322473
DOI10.1006/inco.1994.1013zbMath0805.03008WikidataQ56518661 ScholiaQ56518661MaRDI QIDQ1322473
John C. Mitchell, Luca Cardelli, Simone Martini, Andrej Scedrov
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
Ott: Effective tool support for the working semanticist, Coercion completion and conservativity in coercive subtyping, Divergence of \(F_{\leq}\) type checking, Bounded existentials and minimal typing, Formal parametric polymorphism, Termination of system \(F\)-bounded: A complete proof, Higher-order subtyping, Subtyping recursion and parametric polymorphism in kernel Fun, Basic theory of \(F\)-bounded quantification., A sequent calculus for subtyping polymorphic types, Type destructors, Assigning types to processes, Foundations for virtual types, Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping