Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
From MaRDI portal
Publication:5096235
DOI10.1007/3-540-54415-1_61zbMath1493.68230OpenAlexW1488646136MaRDI QIDQ5096235
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_61
Related Items (4)
Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Strong categorical datatypes II: A term logic for categorical programming ⋮ Relational Parametricity for Control Considered as a Computational Effect ⋮ Formal parametric polymorphism
Cites Work
- Extensional models for polymorphism
- A note on inconsistencies caused by fixpoints in a cartesian closed category
- The semantics of second-order lambda calculus
- Functorial polymorphism
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- The system \({\mathcal F}\) of variable types, fifteen years later
- Domain theoretic models of polymorphism
- A note on categorical datatypes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
