A theoretical basis for stepwise refinement and the programming calculus
- 31 December 1987
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 9 (3) , 287-306
- https://doi.org/10.1016/0167-6423(87)90011-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Programs are predicatesPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1984
- Programming as a mathematical exercisePhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1984
- Predicative programming Part ICommunications of the ACM, 1984
- A Weaker Precondition for LoopsACM Transactions on Programming Languages and Systems, 1982
- Fixed point theorems and semantics: a folk taleInformation Processing Letters, 1982
- The Science of ProgrammingScience of Computer Programming, 1982
- The Equivalence of Bounded Nondeterminacy and ContinuityPublished by Springer Nature ,1982
- Program development by stepwise refinementCommunications of the ACM, 1971