Confluency property of the call-by-value $\lambda\mu^{\wedge \vee}$-calculus
Karim Nour (LAMA), Khelifa Saber (LAMA)

TL;DR
This paper introduces a call-by-value calculus for the lambda-mu system with conjunction and disjunction, proving its Church-Rosser property using an adapted parallel reduction method.
Contribution
It presents the first call-by-value $ ext{lambda} ext{-} ext{mu}^{ ext{wedge} ext{vee}}$-calculus and proves its confluence, extending previous methods to this new system.
Findings
The calculus satisfies the Church-Rosser property.
The proof adapts extended parallel reduction techniques.
Establishes foundational properties for this calculus.
Abstract
In this paper, we introduce the - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou which uses an extended parallel reduction method and complete development.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems
