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

Methods

fmap :: (a -> b) -> Process a -> Process b

(<$) :: a -> Process b -> Process a

Eq a => Eq (Process a)

Methods

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

(/=) :: Process a -> Process a -> Bool

Choice (Process a)

Methods

empty :: Process a

(.|.) :: Process a -> Process a -> Process a

(./.) :: Process a -> Process a -> Process a

(|>) :: Process a -> Process a -> Process a

choice :: [Process a] -> Process a

preference :: [Process a] -> Process a

orelse :: [Process a] -> Process a

Fix (Process a)

Methods

fix :: (Process a -> Process a) -> Process a

Firsts (Process a)

Associated Types

type Elem (Process a) :: *

Methods

ready :: Process a -> Bool

firsts :: Process a -> [(Elem (Process a), Process a)]

Sequence (Process a)

Associated Types

type Sym (Process a) :: *

Methods

done :: Process a

(~>) :: Sym (Process a) -> Process a -> Process a

(.*.) :: Process a -> Process a -> Process a

single :: Sym (Process a) -> Process a

sequence :: [Process a] -> Process a

type Elem (Process a)

type Elem (Process a) = a

type Sym (Process 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]