A short proof that adding some permutation rules to preserves
arXiv:1011.1335 · doi:10.1016/j.tcs.2010.10.048
Abstract
I show that, if a term is for , it remains when some permutation rules are added.
Theoretical Computer Science, 2010
arXiv:1011.1335 · doi:10.1016/j.tcs.2010.10.048
I show that, if a term is for , it remains when some permutation rules are added.
Theoretical Computer Science, 2010