A categorical model for higher order imperative programming

DOI10.1017/S0960129598002552zbMath0916.68095OpenAlexW2113550426MaRDI QIDQ4236215

David A. Naumann

Publication date: 22 March 1999

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129598002552

zbMATH Keywords

higher-order imperative programspre-post specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Trace-Relating Compiler Correctness and Secure Compilation ⋮ Towards patterns for heaps and imperative lambdas ⋮ Imperative abstractions for functional actions ⋮ A Relation-Algebraic Approach to Multirelations and Predicate Transformers ⋮ The algebra of multirelations ⋮ Category Theoretic Models of Data Refinement ⋮ Soundness of data refinement for a higher-order imperative language ⋮ Calculating sharp adaptation rules.