Propositions as sessions

ACM SIGPLAN Notices

Volumn 47, Issue 9, 2012, Pages 273-285

  Wadler, Philip ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Lambda calculus; Linear logic; Pi calculus

Indexed keywords

CLASSICAL LINEAR LOGIC; DEADLOCK FREEDOM; LAMBDA CALCULUS; LINEAR FUNCTIONAL; LINEAR LOGIC; PI CALCULUS; SESSION TYPES;

CALCULATIONS; DIFFERENTIATION (CALCULUS); LINEAR ALGEBRA;

TRANSLATION (LANGUAGES);

EID: 84870396729     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2398856.2364568     Document Type: Conference Paper

References (40)

1. Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1&2):3-57, 1993.
2. Samson Abramsky. Proofs as processes. Theoretical Computer Science, 135(1):5-9, 1994.
3. Samson Abramsky, Simon J. Gay, and Rajagopal Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design, Marktoberdorf, pages 35-113, 1996.
4. Gianluigi Bellin and Philip J. Scott. On the pi-calculus and linear logic. Theoretical Computer Science, 135(1):11-65, 1994.
5. Nick Benton and Philip Wadler. Linear logic, monads and the lambda calculus. In Logic in Computer Science (LICS), pages 420-431, 1996.
6. Martin Berger, Kohei Honda, and Nobuko Yoshida. Genericity and the pi-calculus. Acta Inf., 42(2-3):83-141, 2005.
7. Luís Caires and Frank Pfenning. Session types as intuitionistic linear propositions. In CONCUR, pages 222-236, 2010.
8. Luís Caires, Frank Pfenning, and Bernardo Toninho. Towards concurrent type theory. In Types in Language Design and Implementation (TLDI), January 2012a.
9. Luís Caires, Frank Pfenning, and Bernardo Toninho. Linear logic propositions as session types. Mathematical Structures in Computer Science, 2012b. Submitted.
10. Marco Carbone and Søren Debois. A graphical approach to progress for structured communication in web services. In Interaction and Concurrency Experience (ICE), pages 13-27, 2010.
11. Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen C. Hunt, James R. Larus, and Steven Levi. Language support for fast and reliable message-based communication in Singularity OS. In European Conference on Computer Systems (EuroSys), pages 177-190, 2006.
12. Jean H. Gallier. On Girard's "Candidats de Reducibilité" , pages 123-204. Academic Press, 1990.
13. Simon J. Gay and Malcolm Hole. Subtyping for session types in the pi calculus. Acta Informatica, 42(2-3):191-225, 2005.
14. Simon J. Gay and Vasco T. Vasconcelos. Linear type theory for asynchronous session types. Journal of Functional Programming, 20(1):19-50, 2010.
15. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50: 1-102, 1987.
16. Jean-Yves Girard. A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1(3):255-296, 1991.
17. Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
18. Hugo Herbelin. On the degeneracy of sigma-types in presence of computational classical logic. In Typed Lambda Calculi and Applications (TLCA), pages 209-220, 2005.
19. Kohei Honda. Types for dyadic interaction. In CONCUR, pages 509-523, 1993.
20. Kohei Honda, Vasco T. Vasconcelos, and Makoto Kubo. Language primitives and type discipline for structured communicationbased programming. In European Symposium on Programming (ESOP), pages 122-138, 1998.
21. Naoki Kobayashi. Type systems for concurrent programs. In 10th Anniversary Colloquium of UNU/IIST, LNCS 2757, pages 439-453, 2002.
22. Naoki Kobayashi and Akinori Yonezawa. Acl - a concurrent linear logic programming paradigm. In International Logic Programming Symposium (ILPS), pages 279-294, 1993.
23. Naoki Kobayashi and Akinori Yonezawa. Higher-order concurrent linear logic programming. In Theory and Practice of Parallel Programming, LNCS 907, pages 137-166, 1994.
24. Naoki Kobayashi and Akinori Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113-149, 1995.
25. Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In POPL, pages 358-371, 1996.
26. Karl Mazurak and Steve Zdancewic. Lolliproc: to concurrency from classical linear logic via curry-howard and control. In International Conference on Functional Programming (ICFP), pages 39-50, 2010.
27. Massimo Merro and Davide Sangiorgi. On asynchrony in namepassing calculi. Mathematical Structures in Computer Science, 14(5):715-767, 2004.
28. Dale Miller. The pi-calculus as a theory in linear logic: Preliminary results. In Extensions to Logic Programming, LNCS 660, pages 242-264, 1992.
29. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, i. Information and Computation, 100(1):1-40, 1992.
30. Jorge Pérez, Luís Caires, Frank Pfenning, and Bernardo Toninho. Termination in session-based concurrency via linear logical relations. In European Symposium on Programming (ESOP), 2012.
31. Frank Pfenning, Luís Caires, and Bernardo Toninho. Proofcarrying code in a session-typed process calculus. In Certified Programs and Proofs (CPP), pages 21-36, 2011.
32. Benjamin C. Pierce and Davide Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. Journal of the ACM, 47(3):531-584, 2000.
33. Benjamin C. Pierce and David N. Turner. Pict: a programming language based on the pi-calculus. In Gordon D. Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language, and Interaction, Essays in Honour of Robin Milner, pages 455-494. The MIT Press, 2000. ISBN 978-0-262-16188-6.
34. Andrew M. Pitts. Structural recursion with locally scoped names. J. Funct. Program., 21(3):235-286, 2011.
35. Eijiro Sumii and Naoki Kobayashi. A generalized deadlock-free process calculus. In High-Level Concurrent Languages (HLCL), 1998. ENTCS 16(3):225-247, 1998.
36. Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interactionbased language and its typing system. In C. Halatsis, D. G. Maritsas, G. Philokyprou, and S. Theodoridis, editors, PARLE, LNCS 817, pages 398-413, 1994.
37. Bernardo Toninho, Luís Caires, and Frank Pfenning. Functions as session-typed processes. In Foundations of Software Science and Computation (FoSSaCS), 2012.
38. David N. Turner. The Polymorphic Pi-calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1995.
39. Vasco T. Vasconcelos. Sessions, from types to programming languages. Bulletin of the European Association for Theoretical Computer Science, 103:53-73, 2011.
40. Nobuko Yoshida and Vasco T. Vasconcelos. Language primitives and type discipline for structured communication-based programming revisited: Two systems for higher-order session communication. Electronic Notes in Theoretical Computer Science, 171(4):73-93, 2007.