StrategyLib-4.0.0.0 Contents Index

Data.Generics.Strafunski.StrategyLib.FixpointTheme Portability portable Stability experimental Maintainer Ralf Laemmel, Joost Visser

Contents Fixpoint Iteration Fixpoint Traversal

Description

This module is part of StrategyLib, a library of functional strategy combinators, including combinators for generic traversal. This module defines combinators that iterate until some kind of fixpoint is reached.

Synopsis

repeatTP :: MonadPlus m => TP m -> TP m reduce :: MonadPlus m => TP m -> TP m outermost :: MonadPlus m => TP m -> TP m innermost' :: MonadPlus m => TP m -> TP m innermost :: MonadPlus m => TP m -> TP m

Fixpoint Iteration

repeatTP :: MonadPlus m => TP m -> TP m

Exhaustive repeated application at the root of the input term

Fixpoint Traversal

reduce :: MonadPlus m => TP m -> TP m

Exhaustive repeated application throughout the input term.

outermost :: MonadPlus m => TP m -> TP m

Exhaustive repeated application according to the left-most outermost traversal strategy.

innermost' :: MonadPlus m => TP m -> TP m

Exhaustive repeated application according to the left-most innermost traversal strategy, implemented in a naive way. Use innermost instead.

innermost :: MonadPlus m => TP m -> TP m

Exhaustive repeated application according to the left-most innermost traversal strategy, implemented in a more efficient way.

Produced by Haddock version 0.8