Louis Wasserman wrote:
I just released a package, th-kinds, which attempts to automatically infer
the kind of a specified type, type constructor, type family, type class, or
pretty much anything else that has a kind...
It rolls its own kind inference...
Interesting.
The right way to do this
On Mon, Mar 15, 2010 at 07:31:12PM -0500, Louis Wasserman wrote:
I'm going to phrase this as a challenge, because I think that's likely to
get the best response:
I just released a package,
th-kindshttp://hackage.haskell.org/package/th-kinds,
which attempts to automatically infer the kind of
On Mon, Mar 15, 2010 at 5:31 PM, Louis Wasserman
wasserman.lo...@gmail.com wrote:
GADT types that cannot be reified by TH. Essentially, I think this is the
set of GADT data types that actually couldn't be implemented without GADTs.
Not sure, though. In any event, at the moment, I don't think
Actually, with existential types and type equality constraints, GADTs
are redundant.
The algorithm is pretty simple:
- existentially quantify over all type variables mentioned in the GADT
constructor
- add a type equality constraint to match the result type
- (optional) simplify
While
I'm going to phrase this as a challenge, because I think that's likely to
get the best response:
I just released a package,
th-kindshttp://hackage.haskell.org/package/th-kinds,
which attempts to automatically infer the kind of a specified type, type
constructor, type family, type class, or pretty
