http://conal.net/blog/posts/elegant-memoization-with-higher-order-types 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 http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-646 Sat, 05 Mar 2011 19:51:34 +0000 http://conal.net/blog/?p=117#comment-646 […] To see how to scan over a broad range of functors, let’s look at each of the functor combinators, e.g., as in Elegant memoization with higher-order types. […]

]]> http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-645 Sun, 03 Oct 2010 23:23:33 +0000 http://conal.net/blog/?p=117#comment-645 […] or, using functor combinators, […]

]]> http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-644 Mon, 02 Aug 2010 21:53:36 +0000 http://conal.net/blog/?p=117#comment-644 […] use the same set of functor combinators as in Elegant memoization with higher-order types and Memoizing higher-order […]

]]> http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-643 Fri, 30 Jul 2010 02:56:20 +0000 http://conal.net/blog/?p=117#comment-643 […] in Elegant memoization with higher-order types, let’s use the following […]

]]> http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-642 Thu, 22 Jul 2010 19:38:36 +0000 http://conal.net/blog/?p=117#comment-642 […] About « Elegant memoization with higher-order types […]

]]> http://conal.net/blog/posts/elegant-memoization-with-higher-order-types#comment-641 Thu, 22 Jul 2010 17:40:54 +0000 http://conal.net/blog/?p=117#comment-641 This certainly seems to be amenable to Template Haskell, since TH provides fresh name generation and can handle the simple CPP stuff. I’ve been looking for a little project to brush up on TH, this could be a fun start

]]>