Copyright | (c) Edward Kmett 2013 |
---|---|
License | BSD3 |
Maintainer | Edward Kmett <[email protected]> |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell98 |
Data.Approximate.Mass
Description
Documentation
A quantity with a lower-bound on its probability mass. This represents
a 'probable value' as a Monad
that you can use to calculate progressively
less likely consequences.
NB: These probabilities are all stored in the log domain. This enables us to retain accuracy despite very long multiplication chains. We never add these probabilities so the additional overhead of working in the log domain is never incurred, except on transitioning in and out.
This is most useful for discrete types, such as
small Integral
instances or a Bounded
Enum
like
Bool
.
Also note that (
and &?
)(
are able to use knowledge about the
function to get better precision on their results than naively using
|?
)liftA2
(&&
)
Instances
(|?) :: Mass Bool -> Mass Bool -> Mass Bool infixr 2 Source
Calculate the logical or
of two booleans with confidence lower bounds.