Synthetic domain theory and models of linear Abadi {\&} Plotkin logic

DOI10.1016/J.APAL.2008.03.006zbMath1153.03007OpenAlexW2030533270MaRDI QIDQ952487

Lars Birkedal, Rasmus Ejlers Møgelberg, Giuseppe Rosolini

Publication date: 12 November 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.03.006

zbMATH Keywords

domain theoryparametric polymorphismintuitionistic set theorylinear lambda calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Intuitionistic mathematics (03F55)

Related Items (1)

Unnamed Item

Cites Work

• Categorical logic and type theory
• Relating categorical semantics for intuitionistic linear logic
• Computational adequacy for recursive types in models of intuitionistic set theory
• Domain-theoretical models of parametric polymorphism
• Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
• Linear Abadi and Plotkin Logic
• Categorical models for Abadi and Plotkin's logic for parametricity
• Types, abstraction, and parametric polymorphism, part 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthetic domain theory and models of linear Abadi {\&} Plotkin logic