Results 1 
3 of
3
Laws of programming
 Communications of the ACM
, 1987
"... A complete set of algebraic laws is given for Dijkstra’s nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott’s domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to derivi ..."
Abstract

Cited by 90 (4 self)
 Add to MetaCart
A complete set of algebraic laws is given for Dijkstra’s nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott’s domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.
Virtual Data Structures
 Formal Program Development, Lecture Notes in Computer Science 755
, 1992
"... this paper is to demonstrate a number of techniques which may be used in calculating algorithms for sequenceoriented problems. It may be considered as a further step in the development of a programming method which started with [5]. The basic observation underlying this method is that algorithms ca ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
this paper is to demonstrate a number of techniques which may be used in calculating algorithms for sequenceoriented problems. It may be considered as a further step in the development of a programming method which started with [5]. The basic observation underlying this method is that algorithms can be the result of a systematic development, in which all design decisions and applied insights are clearly identifiable. One might even claim that the essence of an algorithm is its derivation, and not the program text that results from such a derivation
Lazy Abstraction
 IN PROCEEDINGS OF CONFERENCE ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 2002
"... ..."