# A typed parallel $lambda$-calculus for graph-based communication

arXiv: Logic in Computer Science, 2019.

Abstract:

We introduce $lambda_{parallel}$ - a simple yet powerful parallel extension of simply typed $lambda$-calculus. $lambda_{parallel}$ 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 processe...More

Code:

Data:

Tags

Comments