Using Annotations to Make Recursion Equations Behave
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-8 (1) , 21-33
- https://doi.org/10.1109/tse.1982.234771
Abstract
The use of annotated recursion equations as a programming technique is investigated by considering the "telegram problem." The annotations are used to select alternative strategies for evaluating the applicative expressions contained in the recursion equations, while the equations serve as an abstract specification of the desired results. This method has the advantage that the annotations explicitly display certain kinds of decision that would otherwise be implicit.Keywords
This publication has 9 references indexed in Scilit:
- Algorithm = logic + controlCommunications of the ACM, 1979
- Threshold evaluation and the semantics of call by value, assignment and generic proceduresPublished by Association for Computing Machinery (ACM) ,1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- The competence/performance dichotomy in programming preliminary reportPublished by Association for Computing Machinery (ACM) ,1977
- A lazy evaluatorPublished by Association for Computing Machinery (ACM) ,1976
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- The case for structured programmingBIT Numerical Mathematics, 1974
- An experiment in structured programmingBIT Numerical Mathematics, 1972