Explicit renaming of bound variables
Logic
2012-05-02 v5
Abstract
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.
Cite
@article{arxiv.1111.3171,
title = {Explicit renaming of bound variables},
author = {George Cherevichenko},
journal= {arXiv preprint arXiv:1111.3171},
year = {2012}
}
Comments
expanded list of references