Ideas.Common.Strategy.Derived

This module defines extra combinators.

General combinators

permute :: (Choice a, Sequence a) => [a] -> a

Allows all permutations of the list

many :: (Sequence a, Fix a, Choice a) => a -> a

many1 :: (Sequence a, Fix a, Choice a) => a -> a

replicate :: Sequence a => Int -> a -> a

option :: (Choice a, Sequence a) => a -> a

Apply a certain strategy or do nothing (non-greedy)

try :: (Choice a, Sequence a) => a -> a

Apply a certain strategy if this is possible (greedy version of option)

repeat :: (Sequence a, Fix a, Choice a) => a -> a

Repeat a strategy zero or more times (greedy version of many)

repeat1 :: (Sequence a, Fix a, Choice a) => a -> a

Apply a certain strategy at least once (greedy version of many1)

exhaustive :: (Sequence a, Fix a, Choice a) => [a] -> a

Apply the strategies from the list exhaustively (until this is no longer possible)

Process-specific combinators

atomic :: AtomicSymbol a => Process a -> Process a

(<%>) :: (AtomicSymbol a, LabelSymbol a) => Process a -> Process a -> Process a

interleave :: (AtomicSymbol a, LabelSymbol a) => [Process a] -> Process a

(<@>) :: AtomicSymbol a => Process a -> Process a -> Process a

(!*>) :: AtomicSymbol a => Process a -> Process a -> Process a

inits :: AtomicSymbol a => Process a -> Process a

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

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