Ideas.Common.Strategy.Sequential

Documentation

class Sequential f where

Methods

ok, stop :: f a

single :: a -> f a

(~>) :: a -> f a -> f a

(<|>) :: f a -> f a -> f a

(<?>) :: f a -> f a -> f a

(<*>) :: f a -> f a -> f a

choice :: [f a] -> f a

Instances

Sequential Builder

Sequential Process

Sequential (GCore l)

data Process a

Instances

Sequential Process

Eq a => Eq (Process a)

Show a => Show (Process a)

data Builder a

Instances

Sequential Builder

build :: Builder a -> Process a

empty :: Process a -> Bool

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

scanChoice :: (a -> b -> [(a, c)]) -> a -> Process b -> Process c

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

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

data Sym a

Constructors

Single a

Composed (Process a)

atomic :: Sequential f => Process (Sym a) -> f (Sym a)

concurrent :: Sequential f => (a -> Bool) -> Process a -> Process a -> f a

(<@>) :: Sequential f => Process a -> Process a -> f a

withPath :: Process a -> Process (a, Path)

replay :: Monad m => Path -> Process a -> m ([a], Process a)

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

The uniquePath transformation changes the process in such a way that all intermediate states can only be reached by one path. A prerequisite is that symbols are unique (or only used once).

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