Lub

From HaskellWiki

Abstract

Lub is an experiment in computing least upper information bounds on (partially defined) functional values.

It provides a function that is consistent with the unamb operator but has a more liberal precondition. Where requires its arguments to equal when neither is bottom, is able to synthesize a value from the partial information contained in both of its arguments, which is useful with non-flat types.

Besides this wiki page, here are more ways to find out about lub:

• Read the blog post Merging partial values
• Visit the Hackage page for library documentation and to download & install.
• Or install with cabal install lub.
• Get the code repository: darcs get http://code.haskell.org/lub.

I got inspired for this package after stimulating discussions with Thomas Davie, Russell O'Connor others in the #haskell gang.

Categories: Packages | Concurrency