Comments on: Fun with Lazy Arrays: the LZ77 Algorithm http://coder.bsimmons.name/blog/2009/06/fun-with-lazy-arrays-the-lz77-algorithm/ fragmentary ideas ䷿ intellectual what-nots ䷷ and haskell programming ䷴ Mon, 16 Aug 2010 13:21:24 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: The "Prefer One" and "Prefer Opposite" Algorithms for the De Bruijn sequence in Haskell | LAMBDAPHONE http://coder.bsimmons.name/blog/2009/06/fun-with-lazy-arrays-the-lz77-algorithm/comment-page-1/#comment-129 The "Prefer One" and "Prefer Opposite" Algorithms for the De Bruijn sequence in Haskell | LAMBDAPHONE Thu, 24 Sep 2009 04:20:10 +0000 http://coder.bsimmons.name/blog/?p=187#comment-129 [...] And here is my haskell implementation. It works by creating a lazy array which we build from a list being generated by searching the earlier portions of the array that already have been defined. It’s very similar to the method I used in modeling the LZ77 algorithm.: [...]

blockquote {
margin: 2em;
padding: .1em 1.5em;
position: relative;
background: #2F2F2F;
}
">

[...] And here is my haskell implementation. It works by creating a lazy array which we build from a list being generated by searching the earlier portions of the array that already have been defined. It’s very similar to the method I used in modeling the LZ77 algorithm.: [...]

]]> By: Edward kmett http://coder.bsimmons.name/blog/2009/06/fun-with-lazy-arrays-the-lz77-algorithm/comment-page-1/#comment-88 Edward kmett Thu, 25 Jun 2009 16:34:01 +0000 http://coder.bsimmons.name/blog/?p=187#comment-88 You might be interested in a small implementation of LZ78 that I use to reuse expensive monoids that decompresses in the monoid, rather than decompressing the source text. http://comonad.com/haskell/monoids/dist/doc/html/monoids/Data-Generator-Compressive-LZ78.html Of course since a list is a monoid, you can recover the source text. You might be interested in a small implementation of LZ78 that I use to reuse expensive monoids that decompresses in the monoid, rather than decompressing the source text.

http://comonad.com/haskell/monoids/dist/doc/html/monoids/Data-Generator-Compressive-LZ78.html

Of course since a list is a monoid, you can recover the source text.

]]>