Maintainer	bastiaan.heeren@ou.nl
Stability	provisional
Portability	portable (depends on ghc)
Safe Haskell	None
Language	Haskell98

Ideas.Common.Strategy.StrategyTree

Contents

StrategyTree type synonym
Declarations (named combinators)
Dynamic strategies
Arities

Description

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.

Synopsis

type StrategyTree a = CyclicTree (Decl Nary) (Leaf a)
data Leaf a
- = LeafRule (Rule a)
- | LeafDyn (Dynamic a)
treeToProcess :: StrategyTree a -> Process (Leaf a)
mapRulesInTree :: (Rule a -> Rule a) -> StrategyTree a -> StrategyTree a
data Decl f
type Combinator f = forall a. f (Process (Leaf a))
associative :: Decl f -> Decl f
isAssociative :: Decl f -> Bool
combinator :: Decl f -> Combinator f
(.=.) :: IsId n => n -> Combinator f -> Decl f
applyDecl :: Arity f => Decl f -> f (StrategyTree a)
data Dynamic a
makeDynamic :: (IsId n, IsTerm a) => n -> (a -> StrategyTree a) -> Dynamic a
dynamicToTerm :: Dynamic a -> a -> Maybe Term
dynamicTree :: Dynamic a -> a -> Maybe (StrategyTree a)
dynamicFromTerm :: Dynamic a -> Term -> Maybe (StrategyTree a)
class Arity f where
newtype Nullary a = Nullary {
- fromNullary :: a
}
newtype Unary a = Unary {
- fromUnary :: a -> a
}
newtype Binary a = Binary {
- fromBinary :: a -> a -> a
}
newtype Nary a = Nary {
- fromNary :: [a] -> a
}

StrategyTree type synonym

type StrategyTree a = CyclicTree (Decl Nary) (Leaf a) Source #

data Leaf a Source #

Constructors

LeafRule (Rule a)
LeafDyn (Dynamic a)

Instances

Apply Leaf Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods applyAll :: Leaf a -> a -> [a] Source #
LiftView Leaf Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods liftView :: View a b -> Leaf b -> Leaf a Source # liftViewIn :: View a (b, c) -> Leaf b -> Leaf a Source #
Eq (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods (==) :: Leaf a -> Leaf a -> Bool # (/=) :: Leaf a -> Leaf a -> Bool #
Show (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods showsPrec :: Int -> Leaf a -> ShowS # show :: Leaf a -> String # showList :: [Leaf a] -> ShowS #
Minor (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods minor :: Leaf a -> Leaf a Source # setMinor :: Bool -> Leaf a -> Leaf a Source # isMinor :: Leaf a -> Bool Source # isMajor :: Leaf a -> Bool Source #
HasId (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods getId :: Leaf a -> Id Source # changeId :: (Id -> Id) -> Leaf a -> Leaf a Source #
LabelSymbol (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods isEnterSymbol :: Leaf a -> Bool Source #
AtomicSymbol (Leaf a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods atomicOpen :: Leaf a Source # atomicClose :: Leaf a Source #

treeToProcess :: StrategyTree a -> Process (Leaf a) Source #

mapRulesInTree :: (Rule a -> Rule a) -> StrategyTree a -> StrategyTree a Source #

Declarations (named combinators)

data Decl f Source #

Instances

Eq (Decl f) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods (==) :: Decl f -> Decl f -> Bool # (/=) :: Decl f -> Decl f -> Bool #
Show (Decl f) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods showsPrec :: Int -> Decl f -> ShowS # show :: Decl f -> String # showList :: [Decl f] -> ShowS #
HasId (Decl f) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods getId :: Decl f -> Id Source # changeId :: (Id -> Id) -> Decl f -> Decl f Source #

type Combinator f = forall a. f (Process (Leaf a)) Source #

associative :: Decl f -> Decl f Source #

isAssociative :: Decl f -> Bool Source #

combinator :: Decl f -> Combinator f Source #

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

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

Dynamic strategies

data Dynamic a Source #

Instances

Apply Dynamic Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods applyAll :: Dynamic a -> a -> [a] Source #
LiftView Dynamic Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods liftView :: View a b -> Dynamic b -> Dynamic a Source # liftViewIn :: View a (b, c) -> Dynamic b -> Dynamic a Source #
IsStrategy Dynamic Source #
Instance details Defined in Ideas.Common.Strategy.Abstract Methods toStrategy :: Dynamic a -> Strategy a Source #
HasId (Dynamic a) Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods getId :: Dynamic a -> Id Source # changeId :: (Id -> Id) -> Dynamic a -> Dynamic a Source #

makeDynamic :: (IsId n, IsTerm a) => n -> (a -> StrategyTree a) -> Dynamic a Source #

dynamicToTerm :: Dynamic a -> a -> Maybe Term Source #

dynamicTree :: Dynamic a -> a -> Maybe (StrategyTree a) Source #

dynamicFromTerm :: Dynamic a -> Term -> Maybe (StrategyTree a) Source #

Arities

class Arity f where Source #

Minimal complete definition

listify, toArity, liftIso

Methods

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

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

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

Instances

Arity Nary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Nary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Nary a Source # liftIso :: Isomorphism a b -> Nary a -> Nary b Source #
Arity Binary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Binary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Binary a Source # liftIso :: Isomorphism a b -> Binary a -> Binary b Source #
Arity Unary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Unary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Unary a Source # liftIso :: Isomorphism a b -> Unary a -> Unary b Source #
Arity Nullary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Nullary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Nullary a Source # liftIso :: Isomorphism a b -> Nullary a -> Nullary b Source #

newtype Nullary a Source #

Constructors

Nullary
Fields fromNullary :: a

Instances

Arity Nullary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Nullary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Nullary a Source # liftIso :: Isomorphism a b -> Nullary a -> Nullary b Source #

newtype Unary a Source #

Constructors

Unary
Fields fromUnary :: a -> a

Instances

Arity Unary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Unary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Unary a Source # liftIso :: Isomorphism a b -> Unary a -> Unary b Source #

newtype Binary a Source #

Constructors

Binary
Fields fromBinary :: a -> a -> a

Instances

Arity Binary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Binary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Binary a Source # liftIso :: Isomorphism a b -> Binary a -> Binary b Source #

newtype Nary a Source #

Constructors

Nary
Fields fromNary :: [a] -> a

Instances

Arity Nary Source #
Instance details Defined in Ideas.Common.Strategy.StrategyTree Methods listify :: Nary a -> [a] -> Maybe a Source # toArity :: ([a] -> a) -> Nary a Source # liftIso :: Isomorphism a b -> Nary a -> Nary b Source #