cmu

Release 1.12

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.

Repository Hackage Haskell Download

Keywords
library, program, Propose Tags, Skip to Readme, , Last Documentation, cmu-1.12.tar.gz, browse, Package description, Package maintainers, JohnRamsdell, edit package information
License
Other
Install
cabal install cmu-1.12

Documentation

This package contains a library for unification in
commutative monoid and a program that exercises the library.

$ cmu
Commutative monoid unification -- :? for help
cmu> 2x+y=3z
Problem:   2x + y = 3z
Unifier:   [x : g0 + 3g2,y : g0 + 3g1,z : g0 + g1 + 2g2]

cmu> 2x=x+y
Problem:   2x = x + y
Unifier:   [x : g0,y : g0]

cmu> 64x=41y+a
Problem:   64x = a + 41y
Unifier:   [a : 5g0 + 2g1 + 23g2 + g3 + 64g4,x : 2g0 + 9g1 + g2 + 25g3 + g4 + 41g5,y : 3g0 + 14g1 + g2 + 39g3 + 64g5]

cmu> :quit

Stats

Dependent repositories
0
Total releases
13
Latest release
First release
Stars
3
Forks
1
Watchers
2
Contributors
1
Repository size
37.1 KB
SourceRank
7

Development practices

Source repo 2FA enabled
TEXT!
Package manager 2FA enabled
TEXT!
Is security responsive
TEXT!
Dependencies are managed
TEXT!
Issue-free release available
TEXT!
Succession plan available
TEXT!
Package manager 2FA enabled
TEXT!

The Tidelift Subscription provides access to a continuously curated stream of human-researched and maintainer-verified data on open source packages and their licenses, releases, vulnerabilities, and development practices.

Learn more →

Releases

1.0
1.1
1.10
1.11
1.12
1.2
1.3
1.4
1.5
1.6
See all 13 releases

Contributors

John D. Ramsdell


See all contributors

Something wrong with this page? Make a suggestion

Export .ABOUT file for this package

Last synced: 2023-12-02 18:02:29 UTC

Login to resync this project