Ideas.Common.Strategy.Process

Description

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

Synopsis

Documentation

Process data type with efficient support for sequences

Instances

Functor Process Source #
Methods fmap :: (a -> b) -> Process a -> Process b # (<$) :: a -> Process b -> Process a #
Eq a => Eq (Process a) Source #
Methods (==) :: Process a -> Process a -> Bool # (/=) :: Process a -> Process a -> Bool #
Fix (Process a) Source #
Methods fix :: (Process a -> Process a) -> Process a Source #
Choice (Process a) Source #
Methods empty :: Process a Source # (.\|.) :: Process a -> Process a -> Process a Source # (./.) :: Process a -> Process a -> Process a Source # (\|>) :: Process a -> Process a -> Process a Source # choice :: [Process a] -> Process a Source # preference :: [Process a] -> Process a Source # orelse :: [Process a] -> Process a Source #
Firsts (Process a) Source #
Associated Types type Elem (Process a) :: * Source # Methods ready :: Process a -> Bool Source # firsts :: Process a -> [(Elem (Process a), Process a)] Source #
Sequence (Process a) Source #
Associated Types type Sym (Process a) :: * Source # Methods done :: Process a Source # (~>) :: Sym (Process a) -> Process a -> Process a Source # (.*.) :: Process a -> Process a -> Process a Source # single :: Sym (Process a) -> Process a Source # sequence :: [Process a] -> Process a Source #
type Elem (Process a) Source #
type Elem (Process a) = a
type Sym (Process a) Source #
type Sym (Process a) = a

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

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

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

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