Comparison of type families with functional dependencies.
http://article.gmane.org/gmane.comp.lang.haskell.cafe/52948
This is a haskell-cafe post of a brief summary of the commonalities and differences of the two language features.
I research and teach programming languages, compilers, and their applications at the University of New South Wales (UNSW), Sydney. My main interest is in functional and parallel programming, and in particular, in Haskell.
My Twitter handle is TacticalGrace.
Check out my UNSW website.
http://article.gmane.org/gmane.comp.lang.haskell.cafe/52948
This is a haskell-cafe post of a brief summary of the commonalities and differences of the two language features.
http://martijn.van.steenbergen.nl/journal/2009/01/11/type-synonym-families/
They are inspired by code from the MTL and from parser combinators.
http://www.haskell.org/pipermail/haskell-cafe/2009-January/053696.html
The question of how to ensure that one type family is the inverse of another comes up once in a while. Here some concrete code.
