Data refinement, call by value and higher order programs
- 1 November 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 7 (6), 652-662
- https://doi.org/10.1007/bf01210999
Abstract
Using 2-categorical laws of algorithmic refinement, we show soundness of data refinement for stored programs and hence for higher order procedures with value/result parameters. The refinement laws hold in a model that slightly generalizes the standard predicate transformer semantics for the usual imperative programming constructs including prescriptions.Keywords
This publication has 16 references indexed in Scilit:
- An algebraic formulation for data refinementPublished by Springer Nature ,2006
- Power domains and predicate transformers: A topological viewPublished by Springer Nature ,2005
- A categorical model for higher order imperative programmingMathematical Structures in Computer Science, 1998
- Exploring summation and product operators in the refinement calculusLecture Notes in Computer Science, 1995
- A recursion theorem for predicate transformers on inductive data typesInformation Processing Letters, 1994
- An algebraic construction of predicate transformersScience of Computer Programming, 1994
- Computer science: graphsPublished by Cambridge University Press (CUP) ,1994
- Inductive data types for predicate transformersInformation Processing Letters, 1992
- Towards a calculus of data refinementLecture Notes in Computer Science, 1989
- Proof of correctness of data representationsActa Informatica, 1972