cmu: Unification in a Commutative Monoid
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.
[Skip to Readme]
| Versions | 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 1.10, 1.11 |
|---|---|
| Change log | ChangeLog |
| Dependencies | array, base (>=3 && <5), containers (>=0.3) [details] |
| License | LicenseRef-GPL |
| Author | |
| Maintainer | ramsdell@mitre.org |
| Category | Algebra |
| Source repo | head: git clone git://github.com/ramsdell/cmu.git |
| Uploaded | by JohnRamsdell at Mon Jan 8 16:22:12 UTC 2018 |
| Distributions | NixOS:1.11 |
| Executables | cmu |
| Downloads | 4602 total (38 in the last 30 days) |
| Rating | (no votes yet) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-01-08 [all 1 reports] Hackage Matrix CI |
Downloads
- cmu-1.11.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)