Syntactically restricting bounded polymorphism for decidable subtyping

DOI10.1007/978-3-030-64437-6_7zbMATH Open1476.68041OpenAlexW3106635654MaRDI QIDQ2038076FDOQ2038076

Authors: Julian Mackay, Alex Potanin, Jonathan Aldrich, Lindsay Groves 

Publication date: 8 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-64437-6_7

Recommendations

• On the decidability of subtyping with bounded existential types and implementation constraints
• scientific article; zbMATH DE number 814799
• scientific article; zbMATH DE number 2079017
• Syntactic Metatheory of Higher-Order Subtyping
• Bounded quantification is undecidable

zbMATH Keywords

polymorphismfunctional languageslanguage designobject-oriented languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (1)

• On the decidability of subtyping with bounded existential types and implementation constraints

This page was built for publication: Syntactically restricting bounded polymorphism for decidable subtyping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038076)