Relational Reasoning for Recursive Types and References
From MaRDI portal
Publication:5385588
DOI10.1007/11924661_5zbMath1168.68350OpenAlexW1580157489MaRDI QIDQ5385588
Publication date: 6 May 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11924661_5
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
A Nominal Relational Model for Local Store ⋮ A relational realizability model for higher-order stateful ADTs ⋮ Global State Considered Helpful ⋮ Proof-Relevant Logical Relations for Name Generation ⋮ Realisability semantics of parametric polymorphism, general references and recursive types ⋮ Typing termination in a higher-order concurrent imperative language ⋮ Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types ⋮ A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
This page was built for publication: Relational Reasoning for Recursive Types and References
