Type destructors
From MaRDI portal
Publication:1854494
DOI10.1006/inco.2001.2926zbMath1026.68022OpenAlexW4213126308MaRDI QIDQ1854494
Benjamin C. Pierce, Martin Hofmann
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3558b04a5c3f797a883ce0b556f1c267dbc361e9
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursion over realizability structures
- An extension of system \(F\) with subtyping
- Bounded quantification is undecidable
- Comparing object encodings.
- Operations on records
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Simple type-theoretic foundations for object-oriented programming
- A semantic basis for Quest
This page was built for publication: Type destructors
