Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach

02/03/2018
by   F. Aschieri, et al.
0

We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry--Howard correspondence to obtain typed concurrent λ-calculi; each of them features a specific communication mechanism, including broadcasting and cyclic message-exchange, and enhanced expressive power with respect to the λ-calculus. Moreover they all implement forms of code mobility. Our results provide a first concurrent computational interpretation for many propositional intermediate logics, classical logic included.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2019

A note on undecidability of propositional non-associative linear logics

We introduce a non-associative and non-commutative version of propositio...
research
08/24/2021

Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics

We investigate the expressive power of the two main kinds of program log...
research
09/12/2022

A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency

The emergence of propositions-as-sessions, a Curry-Howard correspondence...
research
02/11/2019

A typed parallel λ-calculus for graph-based communication

We introduce λ_∥ - a simple yet powerful parallel extension of simply ty...
research
08/09/2018

Non-Interfering Concurrent Exchange (NICE) Networks

In studying the statistical frequency of exchange in comparison-exchange...
research
04/29/2021

Extracting total Amb programs from proofs

We present a logical system CFP (Concurrent Fixed Point Logic) from whos...
research
11/01/2019

On the construction of multi-valued concurrent dynamic logic

Dynamic logic is a powerful framework for reasoning about imperative pro...

Please sign up or login with your details

Forgot password? Click here to reset