[Haskell] Re: Even higher-order abstract syntax: typeclasses vs GADT

Jim Apple jbapple+haskell at gmail.com
Mon Jan 22 18:11:12 EST 2007

On 1/22/07, Benjamin Franksen <benjamin.franksen at bessy.de> wrote:
> From my very limited understanding of these issues I would say it is not
> possible, neither with type-classes nor with G[AR]DTs because it would mean
> the return type of the function 'typecheck' would have to vary depending on
> the input data, hence you'd need a genuinely dependent type system for such
> a feat.

GADTs are darn near dependent types. Tim Sheard, James Hook, and
Nathan Linger caim that extensible kinds complete the equation in

"GADTs + Extensible Kinds = Dependent Programming"


More information about the Haskell mailing list