Ideas.Common.Strategy.Process

Processes support choices and sequences and are modelled after Hoare's CSP calculus.

Documentation

data Process a

Process data type with efficient support for sequences

Instances

Functor Process

Eq a => Eq (Process a)

Choice (Process a)

Fix (Process a)

Firsts (Process a)

Sequence (Process a)

type Elem (Process a) = a

type Sym (Process a) = a

eqProcessBy :: (a -> a -> Bool) -> Process a -> Process a -> Bool

Generalized equality of processes, which takes an equality function for the symbols.

menu :: Process a -> Menu a (Process a)

withMenu :: Choice b => (a -> Process a -> b) -> b -> Process a -> b

fold :: Choice b => (a -> b -> b) -> b -> Process a -> b

runProcess :: Apply f => Process (f a) -> a -> [a]