Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism

DOI10.1007/11787006_32MaRDI QIDQ3591407zbMATH OpenOpenAlexFDO

Authors Rasmus Ejlers Møgelberg

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_32

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• From parametric polymorphism to models of polymorphic FPC
• Domain-theoretical models of parametric polymorphism
• Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus
• Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
• Domain theoretic models of polymorphism

Cited in

(7)

• A family of syntactic logical relations for the semantics of Haskell-like languages
• Domain-theoretical models of parametric polymorphism
• Selective strictness and parametricity in structural operational semantics, inequationally
• Synthetic domain theory and models of linear Abadi \& Plotkin logic
• From parametric polymorphism to models of polymorphic FPC
• Scott's representation theorem and the univalent Karoubi envelope
• Synthetic domain theory and models of linear Abadi {\&} Plotkin logic

This page was built for publication: Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism

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