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

DOI10.1007/S00354-010-0100-1zbMath1251.68075OpenAlexW2041341597MaRDI QIDQ1758661

Peter Thiemann, Stefan Wehr

Publication date: 16 November 2012

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00354-010-0100-1

zbMATH Keywords

undecidabilityobject-oriented programmingsubtypingbounded existential types

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

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

Uses Software

• Scala

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded existentials and minimal typing
• Bounded quantification is undecidable
• On the decidability of subtyping with bounded existential types and implementation constraints
• Comparing object encodings.
• A REMARK ON "THE PARAMETER DEPENDENCE OF THE COEFFICIENT IN A MODEL FOR CONSTANT PRESSURE STEAM INJECTION IN SOIL"
• Type classes with existential types
• A variant of a recursively unsolvable problem

This page was built for publication: On the decidability of subtyping with bounded existential types and implementation constraints