Revisiting decidable bounded quantification, via dinaturality

DOI10.46298/ENTICS.10474MaRDI QIDQ6831506zbMATH OpenFDO

Authors James Laird

Publication date 2 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/ENTICS.10474

zbMATH Keywords

bounded quantificationdinaturality

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• A modest model of records, inheritance, and bounded quantification
• An extension of system \(F\) with subtyping
• Bounded quantification is undecidable
• Coherence of subsumption, minimum typing and type-checking in F ≤
• Functorial polymorphism
• Game semantics for bounded polymorphism
• The essence of dependent object types

This page was built for publication: Revisiting decidable bounded quantification, via dinaturality

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