An algebraic construction of predicate transformers
From MaRDI portal
Publication:1330446
DOI10.1016/0167-6423(94)90006-XzbMath0807.18003OpenAlexW2173455755MaRDI QIDQ1330446
Oege de Moor, Paul H. B. Gardiner, Clare E. Martin
Publication date: 19 February 1995
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(94)90006-x
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theories (e.g., algebraic theories), structure, and semantics (18C10) Enriched categories (over closed or monoidal categories) (18D20)
Related Items (10)
Trace-Relating Compiler Correctness and Secure Compilation ⋮ Power simulation and its relation to traces and failures refinement ⋮ Towards patterns for heaps and imperative lambdas ⋮ Data refinement, call by value and higher order programs ⋮ A Program Construction and Verification Tool for Separation Logic ⋮ Predicate transformers and higher-order programs ⋮ The algebra of multirelations ⋮ Category Theoretic Models of Data Refinement ⋮ Soundness of data refinement for a higher-order imperative language ⋮ Calculating sharp adaptation rules.
This page was built for publication: An algebraic construction of predicate transformers
