[Haskell-cafe] Associated data types

Jules Bean jules at jellybean.co.uk
Wed Dec 10 08:40:51 EST 2008

Lennart Augustsson wrote:
> For an associated data type D, we know that the type function D is
> injective, i.e., for different indicies given to D we'll get different
> data types.  This makes much more powerful reasoning possible in the
> type checker.  If associated data types are removed there has to be
> some new mechanism to declare an associated type as injective, or the
> type system will lose power.


Are you able to give an example which exploits this "known distinct 
types" effect?

More information about the Haskell-Cafe mailing list