Ideas.Common.Strategy.StrategyTree

Representation of a strategy as a cyclic tree with explicit fixed-points. The nodes in the tree are named strategy combinators. The leafs are rules.

StrategyTree type synonym

type StrategyTree a = CyclicTree (Decl Nary) (Rule a)

Declarations (named combinators)

data Decl f

Instances

Eq (Decl f)

Show (Decl f)

HasId (Decl f)

type Combinator f = forall a. f (Process (Rule a))

associative :: Decl f -> Decl f

isAssociative :: Decl f -> Bool

combinator :: Decl f -> Combinator f

(.=.) :: IsId n => n -> Combinator f -> Decl f infix 1

applyDecl :: Arity f => Decl f -> f (StrategyTree a)

Arities

class Arity f where

Methods

listify :: f a -> [a] -> Maybe a

toArity :: ([a] -> a) -> f a

liftIso :: Isomorphism a b -> f a -> f b

Instances

Arity Nary

Arity Binary

Arity Unary

Arity Nullary

data Nullary a

Constructors

Nullary

Fields

fromNullary :: a

Instances

Arity Nullary

data Unary a

Constructors

Unary

Fields

fromUnary :: a -> a

Instances

Arity Unary

data Binary a

Constructors

Binary

Fields

fromBinary :: a -> a -> a

Instances

Arity Binary

data Nary a

Constructors

Nary

Fields

fromNary :: [a] -> a

Instances

Arity Nary