An exercise in transformational programming: Backtracking and branch-and-bound
- 31 July 1991
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 16 (1) , 19-48
- https://doi.org/10.1016/0167-6423(91)90022-p
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Formal derivation of a pattern matching algorithmScience of Computer Programming, 1989
- Transformational program development in a particular problem domainScience of Computer Programming, 1986
- The promotion and accumulation strategies in transformational programmingACM Transactions on Programming Languages and Systems, 1984
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A synthesis of several sorting algorithmsActa Informatica, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Program development by stepwise refinementCommunications of the ACM, 1971
- An axiomatic basis for computer programmingCommunications of the ACM, 1969