Safe Haskell	Safe-Inferred
Language	Haskell2010

Music.Theory.Random.Jones_1981

Contents

Description

Kevin Jones. "Compositional Applications of Stochastic Processes". Computer Music Journal, 5(2):45-58, 1981.

Synopsis

data G a
- = T a
- | P (G a) (G a)
type Rule k a = k -> a -> Maybe (a, a)
type Probablities k r = (r, [(k, r)])
type SFSG k a r = (Rule k a, Probablities k r)
p_verify :: (Eq a, Num a) => Probablities k a -> Bool
p_select :: (Ord a, Num a) => Probablities k a -> a -> Maybe (Maybe k)
p_select_err :: (Ord a, Num a) => Probablities k a -> a -> Maybe k
g_collect :: G a -> [a]
unfold :: (RandomGen g, Random r, Ord r, Num r) => SFSG k a r -> a -> g -> (G a, g)
sfsg_chain :: (RandomGen g, Random r, Ord r, Num r) => SFSG k a r -> a -> g -> [G a]
sfsg_chain_n :: (RandomGen g, Random r, Ord r, Num r) => Int -> SFSG k a r -> a -> g -> [G a]

Stochastic Finite State Grammars

data G a Source #

Constructors

T a
P (G a) (G a)

Instances details

Show a => Show (G a) Source #
Instance details Defined in Music.Theory.Random.Jones_1981 Methods showsPrec :: Int -> G a -> ShowS # show :: G a -> String # showList :: [G a] -> ShowS #
Eq a => Eq (G a) Source #
Instance details Defined in Music.Theory.Random.Jones_1981 Methods (==) :: G a -> G a -> Bool # (/=) :: G a -> G a -> Bool #

type Rule k a = k -> a -> Maybe (a, a) Source #

type Probablities k r = (r, [(k, r)]) Source #

type SFSG k a r = (Rule k a, Probablities k r) Source #

unfold :: (RandomGen g, Random r, Ord r, Num r) => SFSG k a r -> a -> g -> (G a, g) Source #

sfsg_chain :: (RandomGen g, Random r, Ord r, Num r) => SFSG k a r -> a -> g -> [G a] Source #

sfsg_chain_n :: (RandomGen g, Random r, Ord r, Num r) => Int -> SFSG k a r -> a -> g -> [G a] Source #