Typed Lambda Calculi and Applications

DOI10.1007/b135690zbMath1114.68050OpenAlexW2501230561MaRDI QIDQ5704031

Nick Benton, Benjamin Leperchey

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (11)

A Nominal Relational Model for Local Store ⋮ Algorithmic games for full ground references ⋮ The category-theoretic solution of recursive metric-space equations ⋮ Blaming the client: on data refinement in the presence of pointers ⋮ On Normalization by Evaluation for Object Calculi ⋮ A relational realizability model for higher-order stateful ADTs ⋮ Global State Considered Helpful ⋮ Proof-Relevant Logical Relations for Name Generation ⋮ Typing termination in a higher-order concurrent imperative language ⋮ Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types ⋮ A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

This page was built for publication: Typed Lambda Calculi and Applications