Works exactly like normalizeFreeVaribles(f:LambdaExpression) but allows the specification of your own name generator.
Works exactly like normalizeFreeVaribles(f:LambdaExpression) but allows the specification of your own name generator. Please note that such a normalized formula is still only unique up to alpha equality. Compare for example (all y P(x,y)) with (all x_{0} P(x,x_{0}): the first normalizes to (all y P(x_{0},y) whereas the second normalizes to (all x_{0}1 P(x_{0},x_{0}1)).
the formula to be normalized
a function which generates a fresh name every call.
a pair (g,sub) such that g = sub(f). reversing sub allows to restore the original variables.
Works exactly like normalizeFreeVaribles(f:Formula) but allows the specification of your own name generator.
Works exactly like normalizeFreeVaribles(f:Formula) but allows the specification of your own name generator. Please note that such a normalized formula is still only unique up to alpha equality. Compare for example (all y P(x,y)) with (all x_{0} P(x,x_{0}): the first normalizes to (all y P(x_{0},y whereas the second normalizes to (all x_{0}1 P(x_{0},x_{0}1).
the formula to be normalized
a function which generates a fresh name every call.
a pair (g,sub) such that g = sub(f). reversing sub allows to restore the original variables.
Systematically renames the free variables by their left-to-right occurence in a HOL Expression f to x_{i} where all x_{i} are different from the names of all bound variables in the term.
Systematically renames the free variables by their left-to-right occurence in a HOL Expression f to x_{i} where all x_{i} are different from the names of all bound variables in the term. I.e. reversing the substitution yields the syntactically same formula.
the expression to be normalized
a pair (g,sub) such that g = sub(f). reversing sub allows to restore the original variables.
Systematically renames the free variables by their left-to-right occurence in a HOL Formula f to x_{i} where all x_{i} are different from the names of all bound variables in the term.
Systematically renames the free variables by their left-to-right occurence in a HOL Formula f to x_{i} where all x_{i} are different from the names of all bound variables in the term. I.e. reversing the substitution yields the syntactically same formula.
the formula to be normalized
a pair (g,sub) such that g = sub(f). reversing sub allows to restore the original variables.