probability-0.2.6: Probabilistic Functional Programming

Safe HaskellSafe
LanguageHaskell98

Numeric.Probability.Example.Bayesian

Contents

Description

Approach: model a node with k predecessors as a function with k parameters

Synopsis

Abbreviations, smart constructors

type Probability = Rational Source #

type Dist a = T Probability a Source #

type State a = [a] Source #

type PState a = Dist (State a) Source #

type STrans a = State a -> PState a Source #

type SPred a = a -> State a -> Bool Source #

event :: Probability -> a -> STrans a Source #

happens :: Eq a => SPred a Source #

network :: [STrans a] -> PState a Source #

source :: Probability -> a -> STrans a Source #

bin :: Eq a => a -> a -> Probability -> Probability -> Probability -> Probability -> a -> STrans a Source #

data Nodes Source #

Two possible causes for one effect

Constructors

A 
B 
E 
Instances
Eq Nodes Source # 
Instance details

Defined in Numeric.Probability.Example.Bayesian

Methods

(==) :: Nodes -> Nodes -> Bool #

(/=) :: Nodes -> Nodes -> Bool #

Ord Nodes Source # 
Instance details

Defined in Numeric.Probability.Example.Bayesian

Methods

compare :: Nodes -> Nodes -> Ordering #

(<) :: Nodes -> Nodes -> Bool #

(<=) :: Nodes -> Nodes -> Bool #

(>) :: Nodes -> Nodes -> Bool #

(>=) :: Nodes -> Nodes -> Bool #

max :: Nodes -> Nodes -> Nodes #

min :: Nodes -> Nodes -> Nodes #

Show Nodes Source # 
Instance details

Defined in Numeric.Probability.Example.Bayesian

Methods

showsPrec :: Int -> Nodes -> ShowS #

show :: Nodes -> String #

showList :: [Nodes] -> ShowS #

g :: PState Nodes Source #

queries

e :: Probability Source #

aE :: Probability Source #

bE :: Probability Source #