Relational reasoning in a nominal semantics for storage

DOI10.1007/11417170_8MaRDI QIDQ5704031zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Relational Semantics for Higher-Order Programs
• Relational Reasoning for Recursive Types and References
• A nominal relational model for local store
• Operational reasoning for functions with local state
• Possible world semantics for general storage in call-by-value

Cited in

(12)

• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• Algorithmic games for full ground references
• A nominal relational model for local store
• On Normalization by Evaluation for Object Calculi
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
• Relational Semantics for Higher-Order Programs
• A relational realizability model for higher-order stateful ADTs
• Relational Reasoning for Recursive Types and References
• Global state considered helpful
• The category-theoretic solution of recursive metric-space equations
• Blaming the client: on data refinement in the presence of pointers
• Typing termination in a higher-order concurrent imperative language

This page was built for publication: Relational reasoning in a nominal semantics for storage

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