DeepAI AI Chat
Log In Sign Up

A typed parallel λ-calculus for graph-based communication

by   Federico Aschieri, et al.

We introduce λ_∥ - a simple yet powerful parallel extension of simply typed λ-calculus. λ_∥ is extracted by Curry-Howard correspondence from logics intermediate between classical and intuitionistic logic. Its types are liberal enough to allow arbitrary communication patterns between parallel processes, while guaranteeing that any reduction strategy is terminating. λ_∥ is equipped with an algorithm to extract typing rules from any graph-specified communication topology in such a way that the typed terms can only communicate according to the topology. The expressive power of our language is showcased by examples of parallel programs, ranging from numeric computation to algorithms on graphs.


page 1

page 2

page 3

page 4


Classical Proofs as Parallel Programs

We introduce a first proofs-as-parallel-programs correspondence for clas...

Arrows for Parallel Computation

Arrows are a general interface for computation and an alternative to Mon...

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

We add to intuitionistic logic infinitely many classical disjunctive tau...

Types for Parallel Complexity in the Pi-calculus

Type systems as a way to control or analyze programs have been largely s...

A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework

Graph transformation approaches have been successfully used to analyse a...

On the Verification of Logically Decorated Graph Transformations

We address the problem of reasoning on graph transformations featuring a...

Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

Given a graph rewrite system, a graph G is a quine graph if it has a non...