8523 means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs

07/08/2019
by   Federico Aschieri, et al.
0

Along the lines of the Abramsky "Proofs-as-Processes" program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of λ-calculus with parallelism and communication primitives, called λ_8523. We shall prove that λ_8523 satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and confluence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2022

Linear lambda-calculus is linear

We prove a linearity theorem for an extension of linear logic with addit...
research
02/13/2018

A Concurrent Constraint Programming Interpretation of Access Permissions

A recent trend in object oriented (OO) programming languages is the use ...
research
08/05/2022

Basic Elements of Logical Graphs

We considers how a particular kind of graph corresponds to multiplicativ...
research
09/10/2018

Classical Proofs as Parallel Programs

We introduce a first proofs-as-parallel-programs correspondence for clas...
research
08/15/2018

Multiparty Classical Choreographies

We present Multiparty Classical Choreographies (MCC), a language model w...
research
02/22/2019

Optimizing Space of Parallel Processes

This paper is a contribution to exploring and analyzing space-improvemen...
research
05/21/2018

One Monad to Prove Them All (Functional Pearl)

One Monad to Prove Them All is a modern fairy tale about curiosity and p...

Please sign up or login with your details

Forgot password? Click here to reset