|Memoization of pure-functional procedures email@example.com (Ray Dillinger) (2002-05-23)|
|Re: Memoization of pure-functional procedures firstname.lastname@example.org (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 email@example.com (Joachim Durchholz) (2002-06-02)|
|From:||Bart Demoen <firstname.lastname@example.org>|
|Date:||27 May 2002 01:13:31 -0400|
|Posted-Date:||27 May 2002 01:13:31 EDT|
You might want to have a look at
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.
Return to the
Search the comp.compilers archives again.