hackageDB :: [Package]

Built with Cabal

agum: Unification and Matching in an Abelian Group

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.

Versions1.0, 2.0, 2.1, 2.2
Dependenciesbase (<=4.1.0.0), containers
LicenseGPL
Maintainerramsdell@mitre.org
CategoryAlgebra
Executablesagum
Upload dateThu Sep 17 12:04:42 UTC 2009
Uploaded byJohnRamsdell
Built onghc-6.10, ghc-6.12
DistributionsArch: 2.2

Modules

Downloads