Functions as Processes: The Case of Collapsing Non-determinism

05/02/2022
by   Bas van den Heuvel, et al.
0

This paper studies typed translations of λ-calculi into π-calculi, both with non-determinism, informed by the Curry-Howard isomorphism between linear logic and session types (propositions-as-sessions). Prior work considered calculi with non-collapsing non-determinism, a non-committal form of choice in which all alternatives are preserved, ensuring confluence. A question left open is whether there is a correct translation for calculi with the more traditional (and non-confluent) collapsing non-determinism, which commits to one single alternative and discards the rest. A session-typed π-calculi with collapsing non-determinism is proposed. Next, (i) the key meta-theoretical properties of typed processes (type preservation and deadlock-freedom) are proven following propositions-as-sessions, and (ii) a correct translation of a resource λ-calculus with non-determinism is given. An alternative semantics for non-determinism is then shown to unlock stronger correctness results for the translation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2021

Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version)

Type-preserving translations are effective rigorous tools in the study o...
research
04/30/2021

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

We study encodings of the lambda-calculus into the pi-calculus in the un...
research
01/24/2018

Depending on Session-Typed Processes

This work proposes a dependent type theory that combines functions and s...
research
09/06/2022

Asynchronous Functional Sessions: Cyclic and Concurrent

We present Concurrent GV (CGV), a functional calculus with message-passi...
research
09/12/2019

Open Multiparty Sessions

Multiparty sessions are systems of concurrent processes, which allow sev...
research
06/22/2021

Linear Logic, the π-calculus, and their Metatheory: A Recipe for Proofs as Processes

Initiated by Abramsky [1994], the Proofs as Processes agenda is to estab...
research
08/24/2021

Minimal Translations from Synchronous Communication to Synchronizing Locks

In order to understand the relative expressive power of larger concurren...

Please sign up or login with your details

Forgot password? Click here to reset