Related articles |
---|
Reuse of computations citron@CS.HUJI.AC.IL (1995-09-04) |
Re: Reuse of computations snovack@justright.ICS.UCI.EDU (Steven Novack) (1995-09-09) |
Re: Reuse of computations pardo@cs.washington.edu (1995-09-11) |
Re: Reuse of computations chase@centerline.com (1995-09-12) |
Re: Reuse of computations davids@ICSI.Berkeley.EDU (1995-09-18) |
Newsgroups: | comp.compilers |
From: | chase@centerline.com (David Chase) |
Keywords: | optimize |
Organization: | CenterLine Software |
References: | 95-09-053 |
Date: | Tue, 12 Sep 1995 16:43:28 GMT |
citron@CS.HUJI.AC.IL (Daniel Citron) writes:
> I'm interested in papers that refer to the reuse of previously executed
> computations. I think the term is memoing or memoizing. Are there any
> practical implementations of this concept (in software or hardware)?
See the constant-integer multiplication thread for one instance
of this.
I also recall (don't know it was ever published) that someone once
wrote a "memoizing functional" in Russell -- in theory, a sick person
might be able to do this in C++ with a template (I am sorely tempted
to try).
John Hughes also wrote about Lazy Memo Functions in a long-past (1985?)
proceedings of the conference on Functional Programming Languages and
Computer Architectures (Springer Verlag). I was very impressed by it, but I
don't know if it went anywhere after that. It was massively cool --
lazy memoization subsumes and generalizes Turner's reduction trick for
the Y combinator.
David Chase
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.