lub: least upper bounds -- information merging

[ bsd3, concurrency, data, library, other ] [ Propose Tags ]

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]

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

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.3) [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 2009-01-20T20:10:13Z
Distributions NixOS:0.1.8
Reverse Dependencies 3 direct, 11 indirect [details]
Downloads 9480 total (37 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]

Readme for lub-0.0.5

[back to package description]
See http://haskell.org/haskellwiki/lub for a description of the lub package.

You can configure, build, and install all in the usual way with Cabal
commands.

  runhaskell Setup.lhs configure
  runhaskell Setup.lhs build
  runhaskell Setup.lhs install