lub: least upper bounds -- information merging
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.
Project wiki page: http://haskell.org/haskellwiki/lub
© 2008 by Conal Elliott; BSD3 license.
| Versions | 0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5 |
|---|---|
| Dependencies | base, unamb (>=0.1.3) |
| License | BSD3 |
| Copyright | (c) 2008 by Conal Elliott |
| Author | Conal Elliott |
| Maintainer | conal@conal.net |
| Stability | experimental |
| Category | Concurrency, Data, Other |
| Home page | http://haskell.org/haskellwiki/lub |
| Upload date | Tue Jan 20 20:10:13 UTC 2009 |
| Uploaded by | ConalElliott |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Arch: 0.0.5 |
Modules
Downloads
- lub-0.0.5.tar.gz (Cabal source package)
- package description (included in the package)