[<<][math][>>][..]Thu Dec 29 08:50:12 EST 2011
I'm still in the process of finding a good terminology for "type
commutation" in Haskell, i.e. correspondences like this:
a (b t) <-> b (a t)
a (b t1) (b t2) <-> b (a t1 t2)
and multi-arity variants of this, which seem to be more arbitrary due
to the different ways the t_x can be permuted.
[Reply][About]
[<<][math][>>][..]