Lub: Difference between revisions
m (→Abstract: added "and") |
(→Abstract: repo link fix) |
||
Line 12: | Line 12: | ||
* Visit the [http://hackage.haskell.org/cgi-bin/hackage-scripts/package/lub Hackage page] for library documentation and to download & install. | * Visit the [http://hackage.haskell.org/cgi-bin/hackage-scripts/package/lub Hackage page] for library documentation and to download & install. | ||
* Or install with <tt>cabal install lub</tt>. | * Or install with <tt>cabal install lub</tt>. | ||
* Get the | * Get the [https://github.com/conal/lub code repository]. | ||
<!-- * See the [[lub/Versions| version history]]. --> | <!-- * See the [[lub/Versions| version history]]. --> | ||
<!-- Please leave comments at the [[Talk:lub|Talk page]]. --> | <!-- Please leave comments at the [[Talk:lub|Talk page]]. --> | ||
I got inspired for this package after [http://tunes.org/~nef/logs/haskell/08.11.17 stimulating discussions] with Thomas Davie, Russell O'Connor and others in the #haskell gang. | I got inspired for this package after [http://tunes.org/~nef/logs/haskell/08.11.17 stimulating discussions] with Thomas Davie, Russell O'Connor and others in the #haskell gang. |
Latest revision as of 21:38, 4 February 2014
Abstract
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, 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.
I got inspired for this package after stimulating discussions with Thomas Davie, Russell O'Connor and others in the #haskell gang.