Searching for "Lazy Memo-functions." – sorted by Relevance.
-
Disposable Memo Functions
- of lazy memo-functions in Haskell with an extension to the lazy -calculus, Haskell's computational model
- Cited by 8 (0 self) – Add To MetaCart
-
Lazy Directed Congruence Closure
- , for example, [O'D85]), and the idea of a lazy memo function is due to Hughes in 1985 (see [Hug85]). Lazy
- Cited by 4 (3 self) – Add To MetaCart
-
Science, 88:325--349, 1991. [SWBA90] H. Seidl, R. Wilhelm, and Y. Ben-Asher. Probabilistic load balancing for parallel graph reduction. In
- . Wilhelm. Evaluation of applicative style attributes using lazy memo functions. Technical Report Doc.: M.1
- Add To MetaCart
-
Date: December 7, 2000
- of applicative style attributes using lazy memo functions. Technical Report Doc.: M.1.1.S.1.3-DI-6.0, European
- Add To MetaCart
-
Very Large
- the Software Development Process. ACM SigSoft, 13(5), pages 97-106, 1988. [16] John Hughes. Lazy Memo-functions
- Add To MetaCart
-
Stretching the storage manager: weak pointers and stable names in Haskell
- memo functions, a variant of Hughes' lazy memo functions, and give an operational semantics
- Cited by 22 (2 self) – Add To MetaCart
-
Programming with Variable Functions
- lazy memo function [Hug85], height. The function computes the height of its tree parameter t from
- Cited by 7 (0 self) – Add To MetaCart
-
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
- at least far back as Hughes's 1985 work on lazy memo functions [9]. Our contribution to this dimension
- Cited by 2 (0 self) – Add To MetaCart
-
Term Rewriting with Sharing and Memoïzation
- memoization shall be achieved. In our running example, considering FIB as a (lazy) memo function suffices
- Cited by 3 (1 self) – Add To MetaCart
-
Cycle Therapy:
- at least far back as Hughes’s 1985 work on lazy memo functions [9]. Our contribution to this dimension
- Add To MetaCart

