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

Defined in Ideas.Common.Strategy.Abstract

Methods

applyAll :: Strategy a -> a -> [a]

LiftView Strategy

Defined in Ideas.Common.Strategy.Abstract

Methods

liftView :: View a b -> Strategy b -> Strategy a

liftViewIn :: View a (b, c) -> Strategy b -> Strategy a

IsStrategy Strategy

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: Strategy a -> Strategy a

Show (Strategy a)

Defined in Ideas.Common.Strategy.Abstract

Methods

showsPrec :: Int -> Strategy a -> ShowS

show :: Strategy a -> String

showList :: [Strategy a] -> ShowS

Fix (Strategy a)

Defined in Ideas.Common.Strategy.Abstract

Methods

fix :: (Strategy a -> Strategy a) -> Strategy a

Choice (Strategy a)

Defined in Ideas.Common.Strategy.Abstract

Methods

empty :: Strategy a

(.|.) :: Strategy a -> Strategy a -> Strategy a

(./.) :: Strategy a -> Strategy a -> Strategy a

(|>) :: Strategy a -> Strategy a -> Strategy a

choice :: [Strategy a] -> Strategy a

preference :: [Strategy a] -> Strategy a

orelse :: [Strategy a] -> Strategy a

Sequence (Strategy a)

Defined in Ideas.Common.Strategy.Abstract

Associated Types

type Sym (Strategy a) :: *

Methods

done :: Strategy a

(~>) :: Sym (Strategy a) -> Strategy a -> Strategy a

(.*.) :: Strategy a -> Strategy a -> Strategy a

single :: Sym (Strategy a) -> Strategy a

sequence :: [Strategy a] -> Strategy a

type Sym (Strategy a)

Defined in Ideas.Common.Strategy.Abstract

type Sym (Strategy a) = Rule a

Labeled strategies

data LabeledStrategy a

A strategy which is labeled with an identifier

Instances

Apply LabeledStrategy

Defined in Ideas.Common.Strategy.Abstract

Methods

applyAll :: LabeledStrategy a -> a -> [a]

LiftView LabeledStrategy

Defined in Ideas.Common.Strategy.Abstract

Methods

liftView :: View a b -> LabeledStrategy b -> LabeledStrategy a

liftViewIn :: View a (b, c) -> LabeledStrategy b -> LabeledStrategy a

IsStrategy LabeledStrategy

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: LabeledStrategy a -> Strategy a

Show (LabeledStrategy a)

Defined in Ideas.Common.Strategy.Abstract

Methods

showsPrec :: Int -> LabeledStrategy a -> ShowS

show :: LabeledStrategy a -> String

showList :: [LabeledStrategy a] -> ShowS

HasId (LabeledStrategy a)

Defined in Ideas.Common.Strategy.Abstract

Methods

getId :: LabeledStrategy a -> Id

changeId :: (Id -> Id) -> LabeledStrategy a -> 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

Minimal complete definition

toStrategy

Methods

toStrategy :: f a -> Strategy a

Instances

IsStrategy RewriteRule

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: RewriteRule a -> Strategy a

IsStrategy Rule

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: Rule a -> Strategy a

IsStrategy Dynamic

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: Dynamic a -> Strategy a

IsStrategy LabeledStrategy

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: LabeledStrategy a -> Strategy a

IsStrategy Strategy

Defined in Ideas.Common.Strategy.Abstract

Methods

toStrategy :: Strategy a -> Strategy a

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 a) -> LabeledStrategy a -> LabeledStrategy a

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

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

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