An extension of system F with subtyping

DOI10.1007/3-540-54415-1_73zbMath1496.03058OpenAlexW4206115163WikidataQ56982259 ScholiaQ56982259MaRDI QIDQ5096247

Luca Cardelli, John C. Mitchell, Simone Martini, Andrej Scedrov

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_73

Mathematics Subject Classification ID

Theory of programming languages (68N15) Categorical logic, topoi (03G30) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Types as parameters ⋮ Typed path polymorphism ⋮ Type soundness for path polymorphism ⋮ A descriptive type foundation for RDF Schema ⋮ The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus

Cites Work

• Structural polymorphism
• Functorial polymorphism
• A modest model of records, inheritance, and bounded quantification
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• A semantics of multiple inheritance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of system F with subtyping