© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Improving recursive functions by inverting the order of evaluation
E.A. Boiten
Science of Computer Programming, 18:182-196, January 1992.Abstract
The paper presents a synthetic view of transformations that invert the order of evaluation of recursive functions. Techniques for linear recursive functions are presented. A consideration of stacks motivates the introduction of a general control structure for tabulation. Several transformations for tree-like recursive functions are given.
Bibtex Record
@article{159, author = {E.A. Boiten}, title = {Improving recursive functions by inverting the order of evaluation}, month = {January}, year = {1992}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/1992/159}, journal = {Science of Computer Programming}, volume = {18}, }