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 [RSS] [faq] | 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 1.10, 1.11, 1.12 |
|---|---|
| Change log | ChangeLog |
| Dependencies | array, 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/cmu.git |
| Uploaded | by JohnRamsdell at 2019-10-17T16:46:14Z |
| Distributions | NixOS:1.12 |
| Executables | cmu |
| Downloads | 9582 total (27 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
- CommutativeMonoid
- Algebra.CommutativeMonoid.LinDiophEq
- Algebra.CommutativeMonoid.Unification
- CommutativeMonoid
Downloads
- cmu-1.12.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)