lub
Version 0.1.8 revision 0 uploaded by ConalElliott.
Package meta
- Synopsis
- information operators: least upper bound (lub) and greatest lower bound (glb)
- Description
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-2014 by Conal Elliott; BSD3 license.
- Author
- Conal Elliott
- Bug reports
- n/a
- Category
- Concurrency, Data, Other
- Copyright
- (c) 2008-2014 by Conal Elliott
- Homepage
- http://haskell.org/haskellwiki/lub
- Maintainer
- conal@conal.net
- Package URL
- http://code.haskell.org/~conal/code/lub
- Stability
- experimental