Perhaps this monads discussion might move to [EMAIL PROTECTED]?
It's a good discussion, but it's just what haskell-cafe is for.
http://www.haskell.org/mailinglist.html
Simon
| -----Original Message-----
| From: Arthur H. Gold [mailto:[EMAIL PROTECTED]]
| Sent: 17 May 2001 22:21
| To: [EMAIL PROTECTED]
| Cc: M. Faisal Fariduddin Attar Nasution
| Subject: Re: Questions about Trie
|
|
| > "M. Faisal Fariduddin Attar Nasution" wrote:
| >
| > Greeting, I'm a last year student in a computer science
| field. I'm
| > currently trying to code an implementation for a
| compression using
| > basic Lempel-zif technique. I use a Trie (retrieval)
| as a data
| > structure for the dynamic dictionary aplication. The
| problem is Trie
| > uses not just an ordinary binary tree, but it uses a
| multiple-weighted
| > tree, where one node has at most 256 children. Most
| literatures about
| > Haskell show only binary tree for the example in tree or
| Abstract Data
| > Structures subject. So, does anyone know how to
| code the
| > implementation for trie. Thanks for paying attention and
| I'm really
| > hoping for the answer immediately.
| >
|
| IIRC, there's a trie implementation in Chris Okasaki's
| "Purely Functional Data Structures" -- that might be a start
| (there's also his "Edison" library, which contains many of
| the components you'd need).
|
| HTH (and sorry if it doesn't)
| --ag
|
| --
| Artie Gold, Austin, TX (finger the cs.utexas.edu account for
| more info) mailto:[EMAIL PROTECTED] or mailto:[EMAIL PROTECTED]
| --
| I am looking for work. Contact me.
|
| _______________________________________________
| Haskell mailing list
| [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
|
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
