Derivation of efficient programs for computing sequences of actions
From MaRDI portal
Publication:1093362
DOI10.1016/0304-3975(87)90030-2zbMath0628.68016OpenAlexW2092697071MaRDI QIDQ1093362
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90030-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An iterative solution to the generalized Towers of Hanoi problem
- Towers of Hanoi problems: deriving iterative solutions by program transformations
- The Towers of Hanoi Problem
- A family of rules for recursion removal
- Iteration strikes back - at the cyclic Towers of Hanoi
- An iterative algorithm for the cyclic Towers of Hanoi problem
- The promotion and accumulation strategies in transformational programming
- Mechanical Discovery of Classes of Problem-Solving Strategies
- A Transformation System for Developing Recursive Programs
- Discussion and correspondence: A note on the Towers of Hanoi problem
This page was built for publication: Derivation of efficient programs for computing sequences of actions