Upward confluence in the interaction calculus
Logic in Computer Science
2018-10-16 v4
Abstract
The lambda calculus is not upward confluent, one of counterexamples known thanks to Plotkin. This paper investigates upward confluence in the interaction calculus. Can an interaction system have this property? We positively answer this question and also provide a necessary and sufficient condition for stronger one-step upward confluence which happens to be very restrictive. However, the provided condition is not necessary for upward confluence as we prove that the interaction system of the linear lambda calculus is upward confluent.
Cite
@article{arxiv.1806.07275,
title = {Upward confluence in the interaction calculus},
author = {Anton Salikhmetov},
journal= {arXiv preprint arXiv:1806.07275},
year = {2018}
}
Comments
7 pages, 3 figures