Predicate transformers and higher-order programs
From MaRDI portal
Publication:672318
DOI10.1016/0304-3975(94)00247-GzbMath0874.68024MaRDI QIDQ672318
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
A recursion theorem for predicate transformers on inductive data types ⋮ Higher-Order UTP for a Theory of Methods ⋮ Data refinement, call by value and higher order programs ⋮ Category Theoretic Models of Data Refinement ⋮ Soundness of data refinement for a higher-order imperative language
Cites Work
- Calculating with procedure calls
- A general proof rule for procedures in predicate transformer semantics
- Data refinement by calculation
- Semantical analysis of specification logic
- Equivalence of the Gries and Martin proof rules for procedure calls
- A calculus of refinements for program derivations
- Procedures, parameters, and abstraction: Separate concerns
- Local adjunctions
- On correct refinement of programs
- Domain theory in logical form
- Inductive data types for predicate transformers
- An algebraic construction of predicate transformers
- A recursion theorem for predicate transformers on inductive data types
- A generalization of Naundorf's fixpoint theorem
- Corrigenda: laws of programming
- Pre-adjunctions in order enriched categories
- Can programming be liberated from the von Neumann style?
- The theory of semi-functors
- Categories, relations and dynamic programming
- The specification statement
- Programming as a Discipline of Mathematical Nature
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Predicate transformers and higher-order programs
