lub: information operators: least upper bound (lub) and greatest lower bound (glb)

[ 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.

This module also defines glb, which intersects information.

Project wiki page: http://haskell.org/haskellwiki/lub

© 2008-2014 by Conal Elliott; BSD3 license.

Versions [RSS] [faq] 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 (>=4.6 && <5), unamb (>=0.2.4) [details]
License BSD-3-Clause
Copyright (c) 2008-2014 by Conal Elliott
Author Conal Elliott
Maintainer conal@conal.net
Category Concurrency, Data, Other
Home page http://haskell.org/haskellwiki/lub
Source repo head: git clone git://github.com/conal/lub.git
Uploaded by ConalElliott at 2021-08-31T15:43:37Z
Distributions NixOS:0.1.8
Downloads 8958 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2021-08-31 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates