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.
[Skip to Readme]
Downloads
- lub-0.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 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, 0.1.8 |
---|---|
Dependencies | base, unamb (>=0.1.2) [details] |
License | BSD-3-Clause |
Copyright | (c) 2008 by Conal Elliott |
Author | Conal Elliott |
Maintainer | conal@conal.net |
Category | Concurrency, Data, Other |
Home page | http://haskell.org/haskellwiki/lub |
Uploaded | by ConalElliott at 2008-11-20T05:27:24Z |
Distributions | NixOS:0.1.8 |
Reverse Dependencies | 3 direct, 11 indirect [details] |
Downloads | 9537 total (41 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |