Domain-theoretical models of parametric polymorphism

DOI10.1016/J.TCS.2007.06.016MaRDI QIDQ2464940zbMATH OpenOpenAlexFDO

Authors Lars Birkedal, Rasmus L. Petersen, Rasmus Ejlers Møgelberg

Publication date 18 December 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.06.016

zbMATH Keywords

domain theoryparametric polymorphismrecursive domain equationsrealizability models

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• Domain theoretic models of polymorphism
• From parametric polymorphism to models of polymorphic FPC
• Category-theoretic models of linear Abadi \& Plotkin logic

Cites work

• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 1342281 (Why is no real title available?)
• scientific article; zbMATH DE number 512792 (Why is no real title available?)
• A note on inconsistencies caused by fixpoints in a cartesian closed category
• Axiomatic Domain Theory in Categories of Partial Maps
• Categorical logic and type theory
• Category-theoretic models of linear Abadi \& Plotkin logic
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• Linear Abadi and Plotkin Logic
• Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
• Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
• Parametric polymorphism and operational equivalence
• Semantics of weakening and contraction
• Types and programing languages

Cited in

(18)

• Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• scientific article; zbMATH DE number 5662534 (Why is no real title available?)
• Category-theoretic models of linear Abadi \& Plotkin logic
• Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
• scientific article; zbMATH DE number 2102746 (Why is no real title available?)
• Parametric polymorphism and semantic subtyping
• From parametric polymorphism to models of polymorphic FPC
• A full continuous model of polymorphism
• Parametric Polymorphism — Universally
• Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
• Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
• Parametric polymorphism for XML
• Programming Languages and Systems
• Domain theoretic models of polymorphism
• Synthetic domain theory and models of linear Abadi \& Plotkin logic
• scientific article; zbMATH DE number 4050971 (Why is no real title available?)
• An exper model for Quest

This page was built for publication: Domain-theoretical models of parametric polymorphism

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