Portability | portable |
---|---|

Stability | experimental |

Maintainer | Ralf Laemmel, Joost Visser |

Safe Haskell | None |

This module is part of `StrategyLib`

, a library of functional strategy
combinators, including combinators for generic traversal. This module
overloads basic combinators to enable uniform treatment of TU and TP
strategies. The overloading scheme is motivated in the
... Polymorphic Symphony paper. The names in the present module
deviate from the paper in that they are postfixed by an ...S
in order to rule out name clashes and to avoid labour-intensive
resolution. The class constraints in this module seem to be outrageous
but this has to do with a type inferencing bug for class hierarchies
in hugs. This bug is removed in the October 2002 release.

- class Monad m => Strategy s m where
- class (Strategy s m, Monad m, Term t) => StrategyApply s m t x | s t -> x where
- class (Monad m, Strategy s m) => StrategyMonoid s m where
- class (Strategy s m, Monad m, MonadPlus m) => StrategyPlus s m where
- monoS :: (StrategyApply s m t x, StrategyPlus s m) => (t -> m x) -> s m
- class StrategyMSubst s where

# Unconstrained

class Monad m => Strategy s m whereSource

Overload completely unconstrained strategy combinators

class (Strategy s m, Monad m, Term t) => StrategyApply s m t x | s t -> x whereSource

Overload apply and adhoc combinators

applyS :: s m -> t -> m xSource

Strategy application

adhocS :: s m -> (t -> m x) -> s mSource

Dynamic type case

(Monad m, Term t) => StrategyApply TP m t t | |

(Monad m, Term t) => StrategyApply (TU a) m t a |

# Involving Monoid, MonadPlus,

class (Monad m, Strategy s m) => StrategyMonoid s m whereSource

Overload basic combinators which might involve a monoid

class (Strategy s m, Monad m, MonadPlus m) => StrategyPlus s m whereSource

Overload basic combinators which involve MonadPlus

monoS :: (StrategyApply s m t x, StrategyPlus s m) => (t -> m x) -> s mSource

Overloaded lifting with failure