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.”
Wickham, Hadley
Journal of statistical software 59 (2014): 1-23.
LeCun, Yann, Yoshua Bengio, and Geoffrey Hinton
Nature 521, no. 7553 (2015): 436-444.
Bennett, Charles H., Gilles Brassard, and N. David Mermin
Physical Review Letters 68, no. 5 (1992): 557
Minsky, Marvin
Communications of the ACM 43, no. 8 (2000): 66-73
Turing, Alan
Proceedings of the London mathematical society 2, no. 1 (1937): 230-265
Lloyd, Seth
Nature 406, no. 6799 (2000): 1047-1054
Knuth, Donald E.
The Computer Journal 27, no. 2 (1984): 97-111
Brooks, Frederick P.
IEEE Computer 20, no. 4 (1987): 10-19
Lamport, Leslie, Robert Shostak, and Marshall Pease
ACM Transactions on Programming Languages and Systems (TOPLAS) 4, no. 3 (1982): 382–401
Lindley, Sam, Philip Wadler, and Jeremy Yallop
Journal of Functional Programming 20, no. 1 (2010): 51-69
Wadler, Philip
ACM SIGPLAN Notices 47, no. 9 (2012): 273-286
Richards, Blake A., Timothy Lillicrap, et al.
Nature Neuroscience 22, no. 11 (2019): 1761-1770.