[Haskell-cafe] Re: Unifcation and matching in Abelian groups

John D. Ramsdell wrote in article <7687290b0908190243y70541426x3d485267c4a941ec@mail.gmail.com> 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