{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/cmu","name":"cmu","description":"The unification problem is given the problem\nstatement t =? t', find a most general\nsubstitution s such that s(t) = s(t') modulo\nthe axioms of a commutative monoid.\nSubstitition s is more general than s' if\nthere is a substitition s\" such that s' =\ns\" o s.","version":"1.12","softwareVersion":"1.12","license":"https://spdx.org/licenses/Other","codeRepository":"https://github.com/ramsdell/cmu","issueTracker":"https://github.com/ramsdell/cmu/issues","keywords":["algebra","library","program","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"JohnRamsdell"}],"author":[{"@type":"Person","name":"JohnRamsdell"}],"copyrightHolder":[{"@type":"Person","name":"JohnRamsdell"}],"dateCreated":"2009-09-17","dateModified":"2019-10-17","datePublished":"2019-10-17","copyrightYear":2009,"downloadUrl":"https://hackage.haskell.org/package/cmu-1.12/cmu-1.12.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/cmu"],"https://www.w3.org/ns/activitystreams#likes":4,"https://forgefed.org/ns#forks":1}