Propositions as Sessions

Propositions as Sessions

Wadler, Philip
ACM SIGPLAN Notices 47, no. 9 (2012): 273-286
https://doi.org/10.1145/2398856.2364568

Today, mobile phones, server farms, and multicores make us all concurrent programmers. Where lies a foundation for concurrency as firm as that of λ-calculus? Many process calculi have emerged—ranging from CSP to CCS to π-calculus to join calculus to mobile ambients to bigraphs—but none is as canonical as λ-calculus, and none has the distinction of arising from Curry-Howard.
— Philip Wadler
Blogverzeichnis - Bloggerei.de