Skip Navigation

The Computer Journal 1975 18(1):23-29; doi:10.1093/comjnl/18.1.23
© 1975 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Haskell, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient implementation of a class of recursively defined functions

R. Haskell *

Department of Computing and Control, Imperial College of Science and Technology, 48 Prince's Gardens, London, UK

A method of evaluating recursively defined functions which uses two (or more) stacks is described in this paper. This method is designed to reduce the stack storage needed and requires simpler ‘linkage’ information than the single stack method. In addition, a study of ‘go-to’ (or iterative) type recursive definitions is made and it is shown that these require bounded stack storage for their evaluation.

Received August 1973.

* Department of Computing and Control, Imperial College of Science and Technology, 48 Prince's Gardens, London SW7 1LU


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.