# 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 [faq] | 1.0, 2.0, 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8 |
---|---|

Change log | ChangeLog |

Dependencies | base (>=4.13 && <5), containers (>=0.3) [details] |

License | LicenseRef-GPL |

Author | |

Maintainer | ramsdell@mitre.org |

Category | Algebra |

Source repo | head: git clone git://github.com/ramsdell/agum.git |

Uploaded | by JohnRamsdell at 2019-10-17T16:45:32Z |

Distributions | NixOS:2.8 |

Executables | agum |

Downloads | 7448 total (3 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs not available [build log] All reported builds failed as of 2019-10-17 [all 3 reports] |

## Modules

*Algebra**AbelianGroup*- Algebra.AbelianGroup.IntLinEq
- Algebra.AbelianGroup.UnificationMatching

## Downloads

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