This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1982 (vol. 8 no. 1)
pp. 21-33
J. Schwarz, Bell Laboratories
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.
Index Terms:
recursion equations, Annotations, applicative programming languages, functional programming languages
Citation:
J. Schwarz, "Using Annotations to Make Recursion Equations Behave," IEEE Transactions on Software Engineering, vol. 8, no. 1, pp. 21-33, Jan. 1982, doi:10.1109/TSE.1982.234771
Usage of this product signifies your acceptance of the Terms of Use.