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

@inproceedings{Aschieri2019ATP, title={A typed parallel \$\lambda\$-calculus for graph-based communication.}, author={Federico Aschieri and Agata Ciabattoni and Francesco A. Genco}, year={2019} }

- Published 2019

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… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 28 REFERENCES

## Functions as Processes

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Proofs and types

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Classical Proofs as Parallel Programs

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Gödel logic: From natural deduction to parallel computation

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Propositions as sessions

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The Pi-Calculus - a theory of mobile processes

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A concurrent computational interpretation of intermediate logics

VIEW 1 EXCERPT

## Choreographies, logically

VIEW 1 EXCERPT