Comments on: Memoizing higher-order functions http://conal.net/blog/posts/memoizing-higher-order-functions Inspirations & experiments, mainly about denotative/functional programming in Haskell Sat, 26 Sep 2020 21:06:12 +0000 hourly 1 http://wordpress.org/?v=4.1.17 By: conal http://conal.net/blog/posts/memoizing-higher-order-functions#comment-648 Fri, 23 Jul 2010 21:12:06 +0000 http://conal.net/blog/?p=119#comment-648 Ah, I realized a problem in the technique described in this post. Given a higher-order function to memoize f :: (a -> b) -> c, if the type a (the domain type’s domain type) has infinitely many elements (e.g., Integer or [Bool]), then its corresponding trie t :: a :->: b will be infinitely large. In that case, the usual hyperstrict memoization will insist on evaluating the entire infinite trie. I accidentally avoided this problem in my post by choosing the finite type Bool for a.

I hope & suspect that non-strict memoization will solve this problem. I’m working on the implementation now.

]]>