# 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.

[Skip to Readme]

Versions | 1.0, 2.0, 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7 |
---|---|

Dependencies | base (<=4.1.0.0), containers [details] |

License | LicenseRef-GPL |

Author | |

Maintainer | ramsdell@mitre.org |

Category | Algebra.AbelianGroup |

Uploaded | by JohnRamsdell at Fri Aug 28 13:17:36 UTC 2009 |

Distributions | NixOS:2.7 |

Executables | agum |

Downloads | 3510 total (22 in the last 30 days) |

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |

## Downloads

- agum-1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)