The promotion and accumulation strategies in transformational programming
- 1 October 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 6 (4), 487-504
- https://doi.org/10.1145/1780.1781
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- A System for Assisting Program TransformationACM Transactions on Programming Languages and Systems, 1982
- The semantic elegance of applicative languagesPublished by Association for Computing Machinery (ACM) ,1981
- Tabulation Techniques for Recursive ProgramsACM Computing Surveys, 1980
- Some beautiful arguments using mathematical inductionActa Informatica, 1980
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A synthesis of several sorting algorithmsActa Informatica, 1978
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Expression continuity and the formal differentiation of algorithmsPublished by Association for Computing Machinery (ACM) ,1977