lub: information operators: least upper bound (lub) and greatest lower bound (glb)
Lub is an experiment in computing least upper information bounds on
(partially defined) functional values. It provides a
that is consistent with the
unamb operator but has a more liberal
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.
[Skip to Readme]
|Versions [faq]||0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6, 0.1.1, 0.1.2, 0.1.3, 0.1.5, 0.1.6, 0.1.7|
|Dependencies||base (<5), unamb (>=0.2.4) [details]|
|Copyright||(c) 2008 by Conal Elliott|
|Category||Concurrency, Data, Other|
|Uploaded||by ConalElliott at 2010-09-22T20:17:07Z|
|Downloads||8555 total (27 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees