|
|
|
| Description |
In: x -> y x
x is bound
y is free
|
|
| Synopsis |
|
|
|
| Documentation |
|
|
Instances | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Which variables are mentioned in an expression
|
|
|
| Which variables are introduced at any point,
i.e. LHS of a case alternative, or by a let
|
|
|
| Which variables are in the used in an expression
before being defined. No variable will occur more than once
|
|
|
| Count the number of uses of a free variable.
If a variable is used in different branches of a case, it is only
considered to be the maximum of these two branches.
|
|
|
| Replace all free occurances of variables with a new expression
|
|
|
| Make a whole Core program have unique free variables.
|
|
|
| Make a whole function have unique free variables
|
|
|
Replace all variables which are locally defined with new names
from the given list. Raises an error if not enough free variables
are supplied
If any in the new list clashes with a name in collectFreeVars this
will return a program with different semantics!
Property: collectFreeVars (uniqueFreeVarsWith newvars x) subset newvars
|
|
| Produced by Haddock version 2.6.0 |