Relational interpretations of recursive types in an operational setting.

DOI10.1006/INCO.1999.2828zbMath1045.68504OpenAlexW2134181241MaRDI QIDQ1854316

Lars Birkedal, Robert Harper

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2828

zbMATH Keywords

type systemscompilers for functional languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items (5)

On the relations between monadic semantics ⋮ Non-parametric parametricity ⋮ An operational domain-theoretic treatment of recursive types ⋮ Typing termination in a higher-order concurrent imperative language ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types

Uses Software

• TIL

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Relational properties of domains
• Logical relations and the typed λ-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relational interpretations of recursive types in an operational setting.