[Haskell-cafe] Memoizing longest-common-subsequence

[Jared Updike]

On 8/1/06, Mark T.B. Carroll <Mark.Carroll at aetion.com> wrote:
> I wanted a longest common subsequence function and a bit of Googling
> failed to turn up a functional one, except for in a scary bit of darcs.

I saw a thread from back in the day about this when I was looking for
a good implementation of sdiff (or diff) in Haskell (thank Googleness
for Google):
  http://www.haskell.org/pipermail/haskell/2002-November/010731.html

all message in thread:
  http://www.haskell.org/pipermail/haskell/2002-November/thread.html#10726

  Jared.