Name: agum
Version: 1.0
Maintainer: ramsdell@mitre.org
Cabal-Version: >= 1.2
License: GPL
License-File: license.txt
Synopsis: Unification and Matching in an Abelian Group
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 an Abelian group. The matching
problem is to find a most general substitution
s such that s(t) = t\' modulo the axioms.
Substitition s is more general than s\' if
there is a substitition s\" such that s\' =
s\" o s.
Category: Algebra.AbelianGroup
Build-Type: Simple
Extra-Source-Files: readme.txt Makefile
Library
Build-Depends: base <= 4.1.0.0, containers
Exposed-Modules: Algebra.AbelianGroup.UnificationMatching
Hs-Source-Dirs: src
GHC-Options:
-Wall -fno-warn-name-shadowing -fwarn-unused-imports
Executable agum
Main-Is: Algebra/AbelianGroup/Main.hs
Build-Depends: base <= 4.1.0.0, containers
Other-Modules: Algebra.AbelianGroup.UnificationMatching
Hs-Source-Dirs: src
GHC-Options:
-Wall -fno-warn-name-shadowing -fwarn-unused-imports