Lub

From HaskellWiki

Revision as of 21:34, 19 January 2009 (edit) Conal (Talk | contribs) (unamb link; blog post link) ← Previous diff		Current revision (04:09, 13 July 2010) (edit) (undo) Conal (Talk | contribs) m (→Abstract: added "and")
Line 16:		Line 16:
	<!-- 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 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.

---

Current revision

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 and others in the #haskell gang.

Categories: Packages | Concurrency