John D. Ramsdell <[email protected]> wrote in article <[email protected]> in gmane.comp.lang.haskell.cafe: > I've been studying equational unification. I decided to test my > understanding of it by implementing unification and matching in > Abelian groups. I am quite surprised by how little code it takes. > Let me share it with you.
Thanks! Another small change that might shorten the code is to use Data.Map for linear combinations: type Lin = Data.Map.Map String Int -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig Shaik Riaz _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
