This is about the same as the other paper I linked to, I think, but I&#39;m interested in actually connecting the fully general trie construction to Template Haskell and other facilities to reduce the coder&#39;s overhead of using these tries in practice to a minimum.<br clear="all">

Louis Wasserman<br><a href="mailto:wasserman.louis@gmail.com">wasserman.louis@gmail.com</a><br><br><br>
<div class="gmail_quote">On Wed, Sep 9, 2009 at 10:24 AM, Sean Leather <span dir="ltr">&lt;<a href="mailto:leather@cs.uu.nl">leather@cs.uu.nl</a>&gt;</span> wrote:<br>
<blockquote style="BORDER-LEFT: #ccc 1px solid; MARGIN: 0px 0px 0px 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote"><br>
<div class="gmail_quote">
<div class="im">
<blockquote style="BORDER-LEFT: rgb(204,204,204) 1px solid; MARGIN: 0pt 0pt 0pt 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote">
<div>The goal is similar, but I&#39;m attempting to automatically infer the appropriate map type for any algebraic datatype -- and while I&#39;m at it, the TrieMap package aims to include all the methods Data.Map offers.</div>


<div>
<div></div></div></blockquote></div>
<div><br>Perhaps you want to read about the type-indexed tries in &quot;Generic Haskell: Applications&quot;: <a href="http://www.cs.uu.nl/~johanj/publications/ghpractice.pdf" target="_blank">http://www.cs.uu.nl/~johanj/publications/ghpractice.pdf</a><br>

<br>Sean<br></div></div></blockquote></div><br>