Name: cmu Version: 1.8 Maintainer: ramsdell@mitre.org Cabal-Version: >= 1.2 License: GPL License-File: license.txt Synopsis: Unification in a Commutative Monoid Description: The unification problem is given the problem statement t =? t\', find a most general substitution s such that s(t) = s(t\') modulo the axioms of a commutative monoid. Substitition s is more general than s\' if there is a substitition s\" such that s\' = s\" o s. Category: Algebra Build-Type: Simple Extra-Source-Files: readme.txt ChangeLog Makefile Library Build-Depends: base >= 3 && < 5, containers >= 0.3, array Exposed-Modules: Algebra.CommutativeMonoid.Unification Algebra.CommutativeMonoid.LinDiophEq Hs-Source-Dirs: src GHC-Options: -Wall -fno-warn-name-shadowing -fwarn-unused-imports Executable cmu Main-Is: Algebra/CommutativeMonoid/Main.hs Build-Depends: base >= 3 && < 5, containers >= 0.3, array Other-Modules: Algebra.CommutativeMonoid.Unification Algebra.CommutativeMonoid.LinDiophEq Hs-Source-Dirs: src GHC-Options: -Wall -fno-warn-name-shadowing -fwarn-unused-imports