lub

information operators: least upper bound (lub) and greatest lower bound (glb) http://haskell.org/haskellwiki/lub

Latest on Hackage:0.1.7

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Conal Elliott
Maintained by conal@conal.net

Lub is an experiment in computing least upper information bounds on (partially defined) functional values. It provides a lub function that is consistent with the unamb operator but has a more liberal precondition. Where unamb requires its arguments to equal when neither is bottom, lub is able to synthesize a value from the partial information contained in both of its arguments.

This module also defines glb, which intersects information.

Project wiki page: http://haskell.org/haskellwiki/lub

© 2008 by Conal Elliott; BSD3 license.

Depends on:
Used by 1 package:
comments powered byDisqus