Re: Memoization of pure-functional procedures

Bart Demoen <bmd@cs.kuleuven.ac.be>
27 May 2002 01:13:31 -0400

          From comp.compilers
Related articles
Memoization of pure-functional procedures bear@sonic.net (Ray Dillinger) (2002-05-23)
Re: Memoization of pure-functional procedures bmd@cs.kuleuven.ac.be (Bart Demoen) (2002-05-27)
Re: Memoization of pure-functional procedures bobduff@shell01.TheWorld.com (Robert A Duff) (2002-05-31)
Re: Memoization of pure-functional procedures joachim_d@gmx.de (Joachim Durchholz) (2002-06-02)
| List of all articles for this month |
From: Bart Demoen <bmd@cs.kuleuven.ac.be>
Newsgroups: comp.compilers
Date: 27 May 2002 01:13:31 -0400
Organization: kul
References: 02-05-115
Keywords: optimize
Posted-Date: 27 May 2002 01:13:31 EDT

You might want to have a look at


R.~S. Bird.
Tabulation techniques for recursive programs.
ACM Computing Surveys, 12(4):403--417, Dec. 1980.


Also, if you are serious and adventurous about it, have a look at
papers from people at Stony Brook and their XSB system; I know, it is
logic programming, but tabulation is even more powerful there, and
more difficult, and more worked out
... http://www.cs.sunysb.edu/~warren/ is a good place to start.


Cheers


Bart Demoen

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.