Alpha-conversion for lambda terms with explicit weakenings
Using explicit weakenings, we can define alpha-conversion by simple equations without any mention of free variables.
cs.LO↗
arXiv subjects
George Cherevichenko
Publications and source records attributed to George Cherevichenko.
Is alpha-conversion easy?
We present a new lambda-calculus with explicit substitutions and named variables. Renaming of bound variables in this calculus is explicit (there is a special rewrite rule) and can be delayed. Contexts (environments) are not sets or lists without multiplicity, but have a more complicated structure. There is a natural order on the set of contexts. A "set" of free variables is not a set, but a context in the new sense. New definitions simplify working with alpha-conversion.
cs.LO↗
Explicit renaming of bound variables
We present some lambda calculus with explicit substitutions and named variables. The characteristic feature of this calculus is as follows: renaming of bound variables when performing substitutions is done using special reductions and may be delayed.
math.LO↗