A short proof that adding some permutation rules to $\beta$ preserves $SN$
Logic in Computer Science
2010-11-08 v1
Abstract
I show that, if a term is for , it remains when some permutation rules are added.
Cite
@article{arxiv.1011.1335,
title = {A short proof that adding some permutation rules to $\beta$ preserves $SN$},
author = {Rene David},
journal= {arXiv preprint arXiv:1011.1335},
year = {2010}
}
Comments
Theoretical Computer Science, 2010