An axiomatic approach to binary logical relations with applications to data refinement

DOI10.1007/BFB0014552MaRDI QIDQ4364388zbMATH OpenFDO

Authors Yoshiki Kinoshita, Robert D. Tennent, Peter W. O'Hearn, John Power, Makoto Takeyama

Publication date 15 March 1998

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

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

zbMATH Keywords

abstract data typesdata refinementlogical relationsmonad on category of small categoriesprogramming languagesemantic categorysketches for associated monadsoundness

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Abstract data types; algebraic specification (68Q65)

Recommendations

• Data refinement for call-by-value programming languages
• Axiomatics for data refinement in call by value programming languages
• Prelogical relations
• Pre-logical relations
• An algebraic formulation for data refinement

Cited in

(9)

• Objects and classes in Algol-like languages
• Prelogical relations
• Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
• Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
• scientific article; zbMATH DE number 2038763 (Why is no real title available?)
• Data refinement for call-by-value programming languages
• Category theoretic models of data refinement
• Axiomatics for data refinement in call by value programming languages
• Logical Data Independence Reconsidered (Extended Abstract)

This page was built for publication: An axiomatic approach to binary logical relations with applications to data refinement

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