Ideas.Common.Strategy.Abstract

Abstract data type for a Strategy and a LabeledStrategy.

Strategy data type

data Strategy a

Abstract data type for strategies

Instances

Apply Strategy

LiftView Strategy

IsStrategy Strategy

Show (Strategy a)

Choice (Strategy a)

Fix (Strategy a)

Sequence (Strategy a)

type Sym (Strategy a) = Rule a

Labeled strategies

data LabeledStrategy a

A strategy which is labeled with an identifier

Instances

Apply LabeledStrategy

LiftView LabeledStrategy

IsStrategy LabeledStrategy

Show (LabeledStrategy a)

HasId (LabeledStrategy a)

label :: (IsId l, IsStrategy f) => l -> f a -> LabeledStrategy a

Labels a strategy with an identifier. Labels are used to identify substrategies and to specialize feedback messages. The first argument of label can be of type String, in which case the string is used as identifier (and not as description).

unlabel :: LabeledStrategy a -> Strategy a

Removes the label from a strategy

Lifting to strategies

class IsStrategy f where

Type class to turn values into strategies

Methods

toStrategy :: f a -> Strategy a

Instances

IsStrategy RewriteRule

IsStrategy Rule

IsStrategy LabeledStrategy

IsStrategy Strategy

liftS :: IsStrategy f => (Strategy a -> Strategy a) -> f a -> Strategy a

liftS2 :: (IsStrategy f, IsStrategy g) => (Strategy a -> Strategy a -> Strategy a) -> f a -> g a -> Strategy a

liftSn :: IsStrategy f => ([Strategy a] -> Strategy a) -> [f a] -> Strategy a

Prefixes

emptyPrefix :: IsStrategy f => f a -> a -> Prefix a

Construct the empty prefix for a labeled strategy

replayPath :: IsStrategy f => Path -> f a -> a -> ([Rule a], Prefix a)

Construct a prefix for a path and a labeled strategy. The third argument is the current term.

replayPaths :: IsStrategy f => [Path] -> f a -> a -> Prefix a

Construct a prefix for a list of paths and a labeled strategy. The third argument is the current term.

replayStrategy :: (Monad m, IsStrategy f) => Path -> f a -> a -> m (a, Prefix a)

Construct a prefix for a path and a labeled strategy. The third argument is the initial term.

Rules

rulesInStrategy :: IsStrategy f => f a -> [Rule a]

Returns a list of all major rules that are part of a labeled strategy

mapRules :: (Rule a -> Rule b) -> LabeledStrategy a -> LabeledStrategy b

Apply a function to all the rules that make up a labeled strategy

mapRulesS :: (Rule a -> Rule b) -> Strategy a -> Strategy b

cleanUpStrategy :: (a -> a) -> LabeledStrategy a -> LabeledStrategy a

Use a function as do-after hook for all rules in a labeled strategy, but also use the function beforehand

cleanUpStrategyAfter :: (a -> a) -> LabeledStrategy a -> LabeledStrategy a

Use a function as do-after hook for all rules in a labeled strategy

derivationList :: IsStrategy f => (Rule a -> Rule a -> Ordering) -> f a -> a -> [Derivation (Rule a, Environment) a]

Access to underlying representation

toStrategyTree :: IsStrategy f => f a -> StrategyTree a

onStrategyTree :: IsStrategy f => (StrategyTree a -> StrategyTree a) -> f a -> Strategy a

Strategy declarations

useDecl :: Arity f => Decl f -> f (Strategy a)

decl0 :: Decl Nullary -> Strategy a

decl1 :: IsStrategy f => Decl Unary -> f a -> Strategy a

decl2 :: (IsStrategy f, IsStrategy g) => Decl Binary -> f a -> g a -> Strategy a

declN :: IsStrategy f => Decl Nary -> [f a] -> Strategy a