Content-Type: text/shitpost


Subject: Knuth-Bendix completion for Haskell functional laws
Path: you​!your-host​!ultron​!the-matrix​!mechanical-turk​!skynet​!m5​!plovergw​!ploverhub​!shitpost​!mjd
Date: 2018-10-23T20:41:54
Newsgroup: rec.food.knuth-bendix-haskell
Message-ID: <c83a92e6d32ea947@shitpost.plover.com>
Content-Type: text/shitpost

One can use the Knuth-Bendix algorithm to determine, for example, which subsets of the group laws necessarily imply the others. (For example, any associative binary operation with an identity element and left-side inverses must necessarily have right-side inverses also.)

Could this similarly be done to find minimal sets of haskell instance operators? Say to determine that return and join together imply return and >>=, and vice versa, but that >>= and join together do not imply return?