[<<][meta][>>][..]
Sun May 9 15:58:15 EDT 2010

Memo again

So, what about the memo.  It seems simplest to use hash consing
(memoized constructors) for the graph structure.

It seems that hashing the Graph constructor Node should be enough.
How to abstract this?

The hashing table is exactly what I'm looking for as the output of the
algorithm.  So, if the constructors of Graph can be hidden behind
monadic functions, this might come for free when converting between
Term and Graph rep.  Or am I missing something again?


[1] http://www.haskell.org/haskellwiki/MemoisingCafs



[Reply][About]
[<<][meta][>>][..]