Re: [Haskell-cafe] Deconstructing types

Hello Louis, On Tue, Sep 8, 2009 at 19:06, Louis Wasserman wasserman.lo...@gmail.comwrote: Sean, The answer is, I'm working on a recently semi-released package called TrieMap. Is that similar to what is done in [1]? A draft paper [2] also refers that implementation. Cheers, Pedro [1]

Re: [Haskell-cafe] Deconstructing types

The goal is similar, but I'm attempting to automatically infer the appropriate map type for any algebraic datatype -- and while I'm at it, the TrieMap package aims to include all the methods Data.Map offers. Louis Wasserman wasserman.lo...@gmail.com 2009/9/9 José Pedro Magalhães j...@cs.uu.nl

Re: [Haskell-cafe] Deconstructing types

The goal is similar, but I'm attempting to automatically infer the appropriate map type for any algebraic datatype -- and while I'm at it, the TrieMap package aims to include all the methods Data.Map offers. Perhaps you want to read about the type-indexed tries in Generic Haskell:

Re: [Haskell-cafe] Deconstructing types

This is about the same as the other paper I linked to, I think, but I'm interested in actually connecting the fully general trie construction to Template Haskell and other facilities to reduce the coder's overhead of using these tries in practice to a minimum. Louis Wasserman

Re: [Haskell-cafe] Deconstructing types

I don't know a thing about SYB, Data.Data, or Data.Typeable, mostly because I'm an efficiency fanatic. Nevertheless, I'd like to know whether or not there's a way to deconstruct a (mostly) arbitrary type, into tuples, unions, etc. using this framework. Any thoughts? You can use the

Re: [Haskell-cafe] Deconstructing types

Sean, The answer is, I'm working on a recently semi-released package called TrieMap. The objective of this package, building off of the work in this paperhttps://docs.google.com/Doc?docid=0AWuaUF8ZNTNDZHB3emdyaF8zMzNmZmtmcHo2Ywhl=en, is to automatically derive the type of a generalized trie for

Re: [Haskell-cafe] Deconstructing types

The answer is, I'm working on a recently semi-released package called TrieMap. The objective of this package, building off of the work in this paperhttps://docs.google.com/Doc?docid=0AWuaUF8ZNTNDZHB3emdyaF8zMzNmZmtmcHo2Ywhl=en, is to automatically derive the type of a generalized trie for

Re: [Haskell-cafe] Deconstructing types

Oh, geez. Wrong link. I meant http://portal.acm.org/citation.cfm?id=967471 . Louis Wasserman wasserman.lo...@gmail.com On Tue, Sep 8, 2009 at 1:06 PM, Louis Wasserman wasserman.lo...@gmail.comwrote: Sean, The answer is, I'm working on a recently semi-released package called TrieMap.

[Haskell-cafe] Deconstructing types

Yo, I don't know a thing about SYB, Data.Data, or Data.Typeable, mostly because I'm an efficiency fanatic. Nevertheless, I'd like to know whether or not there's a way to deconstruct a (mostly) arbitrary type, into tuples, unions, etc. using this framework. Any thoughts? Louis Wasserman