Data refinement, call by value and higher order programs
From MaRDI portal
(Redirected from Publication:1906039)
Recommendations
Cites work
- A recursion theorem for predicate transformers on inductive data types
- An algebraic construction of predicate transformers
- Data refinement of predicate transformers
- Domain theory in logical form
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 4087890 (Why is no real title available?)
- scientific article; zbMATH DE number 3705887 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 41225 (Why is no real title available?)
- scientific article; zbMATH DE number 107664 (Why is no real title available?)
- scientific article; zbMATH DE number 605806 (Why is no real title available?)
- scientific article; zbMATH DE number 1142318 (Why is no real title available?)
- Inductive data types for predicate transformers
- Laws of data refinement
- Predicate transformers and higher-order programs
- Proof of correctness of data representations
Cited in
(9)- Data refinement and algebraic structure
- Soundness of data refinement for a higher-order imperative language
- A categorical model for higher order imperative programming
- scientific article; zbMATH DE number 2038763 (Why is no real title available?)
- scientific article; zbMATH DE number 1424060 (Why is no real title available?)
- Category theoretic models of data refinement
- Axiomatics for data refinement in call by value programming languages
- An algebraic formulation for data refinement
- Predicate transformers and higher-order programs
This page was built for publication: Data refinement, call by value and higher order programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906039)