| Maintainer | Ralf Laemmel, Joost Visser |
|---|---|
| Stability | experimental |
| Portability | portable |
| Safe Haskell | None |
| Language | Haskell98 |
Data.Generics.Strafunski.StrategyLib.RefactoringTheme
Description
This module is part of StrategyLib, a library of functional strategy
combinators, including combinators for generic traversal. This module
defines generic refactoring functionality. See the paper "Towards
Generic Refactoring" by Ralf Laemmel. See also
generic-refactoring in the examples directory.
- class (Term abstr, Eq name, Term [abstr], Term apply) => Abstraction abstr name tpe apply | abstr -> name, abstr -> tpe, abstr -> apply, apply -> name, apply -> abstr where
- eliminate :: (Term prog, Abstraction abstr name tpe apply) => TU [(name, tpe)] Identity -> TU [name] Identity -> (abstr -> Maybe abstr) -> prog -> Maybe prog
- introduce :: (Term prog, Abstraction abstr name tpe apply) => TU [(name, tpe)] Identity -> TU [name] Identity -> ([abstr] -> Maybe [abstr]) -> abstr -> prog -> Maybe prog
- extract :: (Term prog, Abstraction abstr name tpe apply) => TU [(name, tpe)] Identity -> TU [name] Identity -> (apply -> Maybe apply) -> ([abstr] -> [abstr]) -> ([abstr] -> Maybe [abstr]) -> ([(name, tpe)] -> apply -> Bool) -> name -> prog -> Maybe prog
The abstraction interface
class (Term abstr, Eq name, Term [abstr], Term apply) => Abstraction abstr name tpe apply | abstr -> name, abstr -> tpe, abstr -> apply, apply -> name, apply -> abstr where Source #
Class of abstractions
Minimal complete definition
getAbstrName, getAbstrParas, getAbstrBody, getApplyName, getApplyParas, constrAbstr, constrApply
Methods
getAbstrName :: abstr -> Maybe name Source #
getAbstrParas :: abstr -> Maybe [(name, tpe)] Source #
getAbstrBody :: abstr -> Maybe apply Source #
getApplyName :: apply -> Maybe name Source #
getApplyParas :: apply -> Maybe [(name, tpe)] Source #
constrAbstr :: name -> [(name, tpe)] -> apply -> Maybe abstr Source #
constrApply :: name -> [(name, tpe)] -> Maybe apply Source #
Removal
Arguments
| :: (Term prog, Abstraction abstr name tpe apply) | |
| => TU [(name, tpe)] Identity | Identify declarations |
| -> TU [name] Identity | Identify references |
| -> (abstr -> Maybe abstr) | Unwrap abstraction |
| -> prog | Input program |
| -> Maybe prog | Output program |
Remove an unused abstraction
Insertion
Arguments
| :: (Term prog, Abstraction abstr name tpe apply) | |
| => TU [(name, tpe)] Identity | Identify declarations |
| -> TU [name] Identity | Identify references |
| -> ([abstr] -> Maybe [abstr]) | Unwrap scope with abstractions |
| -> abstr | Abstraction to be inserted |
| -> prog | Input program |
| -> Maybe prog | Output program |
Insert a new abstraction
Generic extraction (say fold)
Arguments
| :: (Term prog, Abstraction abstr name tpe apply) | |
| => TU [(name, tpe)] Identity | Identify declarations |
| -> TU [name] Identity | Identify references |
| -> (apply -> Maybe apply) | Unwrap focus |
| -> ([abstr] -> [abstr]) | Wrap host |
| -> ([abstr] -> Maybe [abstr]) | Unwrap host |
| -> ([(name, tpe)] -> apply -> Bool) | Check focus |
| -> name | Name for abstraction |
| -> prog | Input program |
| -> Maybe prog | Output program |
Extract an abstraction