From parametric polymorphism to models of polymorphic FPC
From MaRDI portal
Recommendations
- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
- Domain-theoretical models of parametric polymorphism
- Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
- Domain theoretic models of polymorphism
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
Cites work
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 1840601 (Why is no real title available?)
- A small complete category
- Axiomatic Domain Theory in Categories of Partial Maps
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Categorical models for Abadi and Plotkin's logic for parametricity
- Data Types as Lattices
- Free theorems in the presence of seq
- Linear logic
- Monads on symmetric monoidal closed categories
- Relational properties of domains
- Semantics of weakening and contraction
- Strong functors and monoidal monads
Cited in
(5)- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
- Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
- Domain-theoretical models of parametric polymorphism
- A full continuous model of polymorphism
- Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
This page was built for publication: From parametric polymorphism to models of polymorphic FPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395309)
