Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76c49bb84f-c7tcl Total loading time: 0 Render date: 2025-07-03T12:25:45.050Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  12 June 2025

Simon J. Gay  and
Vasco T. Vasconcelos
Simon J. Gay
Affiliation:
University of Glasgow
Vasco T. Vasconcelos
Affiliation:
Universidade de Lisboa
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Chapter
Information
Session Types , pp. 227 - 231
Publisher: Cambridge University Press
Print publication year: 2025

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

Abramsky, Samson. Computational interpretations of linear logic. Theor. Comput. Sci., 111(1&2):3–57, 1993.CrossRefGoogle Scholar
Abramsky, Samson. Proofs as processes. Theor. Comput. Sci., 135(1):5–9, 1994.CrossRefGoogle Scholar
Abramsky, Samson, Gay, Simon J., and Nagarajan, Rajagopal. Interaction categories and the foundations of typed concurrent programming. In Broy, Manfred, editor, Proceedings of the NATO Advanced Study Institute on Deductive Program Design, Marktoberdorf, Germany, pages 35–113, 1996.CrossRefGoogle Scholar
Almeida, Bernardo, Mordido, Andreia, Thiemann, Peter, and Vasconcelos, Vasco T.. Polymorphic lambda calculus with context-free session types. Inf. Comput., 289(Part):104948, 2022.CrossRefGoogle Scholar
Ancona, Davide, Bono, Viviana, Bravetti, Mario, Campos, Joana, Castagna, Giuseppe, Deniélou, Pierre-Malo, Gay, Simon J., Gesbert, Nils, Giachino, Elena, Hu, Raymond, Einar Broch Johnsen, Martins, Francisco, Mascardi, Viviana, Montesi, Fabrizio, Neykova, Rumyana, Ng, Nicholas, Padovani, Luca, Vasconcelos, Vasco T., and Yoshida, Nobuko. Behavioral types in programming languages. Found. Trends Program. Lang., 3(2-3):95–230, 2016.CrossRefGoogle Scholar
Balzer, Stephanie and Pfenning, Frank. Manifest sharing with session types. Proc. ACM Program. Lang., 1 (ICFP):37:1–37:29, 2017.CrossRefGoogle Scholar
Barber, Alan and Plotkin, Gordon. Dual intuitionistic linear logic. Technical Report LFCS-96-347, University of Edinburgh, 1997.Google Scholar
Barendregt, Hendrik Pieter. The lambda calculus - its syntax and semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1985.Google Scholar
Barr, Michael. *-autonomous categories and linear logic. Math. Struct. Comp. Sci., 1(2):159–178, 1999.CrossRefGoogle Scholar
Bellin, Gianluigi and Scott, Philip J.. On the π-calculus and linear logic. Theor. Comput. Sci., 135(1):11–65, 1994.CrossRefGoogle Scholar
Bernardi, Giovanni and Hennessy, Matthew. Using higher-order contracts to model session types. Log. Methods Comput. Sci., 12(2), 2016.Google Scholar
Braüner, Torben. Introduction to linear logic. Technical Report LS-96-6, BRICS, University of Aarhus, 1996.Google Scholar
Bravetti, Mario, Carbone, Marco, and Zavattaro, Gianluigi. Undecidability of asynchronous session subtyping. Inf. Comput., 256:300–320, 2017.CrossRefGoogle Scholar
Caires, Luís and Pfenning, Frank. Session types as intuitionistic linear propositions. In Gastin, Paul and Laroussinie, François, editors, Proceedings of CONCUR, volume 6269 of Lecture Notes in Computer Science, pages 222–236. Springer, 2010.Google Scholar
Caires, Luís, Pfenning, Frank, and Toninho, Bernardo. Linear logic propositions as session types. Math. Struct. Comput. Sci., 26(3):367–423, 2016.CrossRefGoogle Scholar
Chen, Ruofei, Balzer, Stephanie, and Toninho, Bernardo. Ferrite: a judgmental embedding of session types in Rust. In Ali, Karim and Vitek, Jan, editors, Proceedings of ECOOP, volume 222 of LIPIcs, pages 22:1–22:28. Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2022.Google Scholar
Tzu-Chun Chen, Mariangiola Dezani-Ciancaglini, Scalas, Alceste, and Yoshida, Nobuko. On the preciseness of subtyping in session types. Log. Methods Comput. Sci., 13(2), 2017.Google Scholar
Coppo, Mario, Dezani-Ciancaglini, Mariangiola, Yoshida, Nobuko, and Padovani, Luca. Global progress for dynamically interleaved multiparty sessions. Math. Struct. Comput. Sci., 26(2):238–302, 2016.CrossRefGoogle Scholar
Cranen, Sjoerd, Groote, Jan Friso, Keiren, Jeroen J. A., Stappers, Frank P. M., de Vink, Erik P., Wesselink, Wieger, and Willemse, Tim A. C.. An overview of the mCRL2 toolset and its recent advances. In Piterman, Nir and Smolka, Scott A., editors, Proceedings of TACAS, volume 7795 of Lecture Notes in Computer Science, pages 199–213. Springer, 2013.Google Scholar
Dardha, Ornela. Recursive session types revisited. In Carbone, Marco, editor, Proceedings of BEAT, volume 162 of EPTCS, pages 27–34, 2014.CrossRefGoogle Scholar
Dardha, Ornela. Type Systems for Distributed Programs: Components and Sessions, volume 7 of Atlantis Studies in Computing. Springer / Atlantis Press, 2016.CrossRefGoogle Scholar
Dardha, Ornela and Gay, Simon J.. A new linear logic for deadlock-free session-typed processes. In Baier, Christel and Lago, Ugo Dal, editors, Proceedings of FOSSACS, volume 10803 of Lecture Notes in Computer Science, pages 91–109. Springer, 2018.Google Scholar
Dardha, Ornela, Giachino, Elena, and Sangiorgi, Davide. Session types revisited. In Schreye, Danny De, Janssens, Gerda, and King, Andy, editors, Proceedings of PPDP, pages 139–150. ACM, 2012.CrossRefGoogle Scholar
Dardha, Ornela, Giachino, Elena, and Sangiorgi, Davide. Session types revisited. Inf. Comput., 256:253–286, 2017.CrossRefGoogle Scholar
Fowler, Simon, Lindley, Sam, Garrett Morris, J., and Decova, Sára. Exceptional asynchronous session types: Session types without tiers. Proc. ACM Program. Lang., 3 (POPL):28:1–28:29, 2019.CrossRefGoogle Scholar
The FreeST programming language. freest-lang.github.io. Last accessed 2024.Google Scholar
Gay, Simon J.. Subtyping supports safe session substitution. In Lindley, Sam, McBride, Conor, Trinder, Philip W., and Sannella, Donald, editors, A List of Successes That Can Change the World — Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday, volume 9600 of Lecture Notes in Computer Science, pages 95–108. Springer, 2016.Google Scholar
Gay, Simon J. and Hole, Malcolm. Types and subtypes for client-server interactions. In Swierstra, S. Doaitse, editor, Proceedings of ESOP, volume 1576 of Lecture Notes in Computer Science, pages 74–90. Springer, 1999.Google Scholar
Gay, Simon J. and Hole, Malcolm. Subtyping for session types in the pi calculus. Acta Informatica, 42(2-3):191–225, 2005.CrossRefGoogle Scholar
Gay, Simon J., Poças, Diogo, and T, Vasco. Vasconcelos. The different shades of infinite session types. In Bouyer, Patricia and Schröder, Lutz, editors, Proceedings of FOSSACS, volume 13242 of Lecture Notes in Computer Science, pages 347–367. Springer, 2022.Google Scholar
Gay, Simon J., Thiemann, Peter, and T, Vasco. Vasconcelos. Duality of session types: the final cut. In Balzer, Stephanie and Padovani, Luca, editors, Proceedings of PLACES, volume 314 of EPTCS, pages 23–33, 2020.CrossRefGoogle Scholar
Gay, Simon J. and Vasconcelos, Vasco Thudichum. Linear type theory for asynchronous session types. J. Funct. Program., 20(1):19–50, 2010.CrossRefGoogle Scholar
Girard, Jean-Yves. Linear logic. Theor. Comput. Sci., 50:1–102, 1987.CrossRefGoogle Scholar
Harper, Robert. Practical Foundations for Programming Languages (2nd. Ed.). Cambridge University Press, 2016.CrossRefGoogle Scholar
Honda, Kohei. Types for dyadic interaction. In Best, Eike, editor, Proceedings of CONCUR, volume 715 of Lecture Notes in Computer Science, pages 509–523. Springer, 1993.CrossRefGoogle Scholar
Honda, Kohei, Vasconcelos, Vasco Thudichum, and Kubo, Makoto. Language primitives and type discipline for structured communication-based programming. In Hankin, Chris, editor, Proceedings of ESOP, volume 1381 of Lecture Notes in Computer Science, pages 122–138. Springer, 1998.Google Scholar
Honda, Kohei, Yoshida, Nobuko, and Carbone, Marco. Multiparty asynchronous session types. In Necula, George C. and Wadler, Philip, editors, Proceedings of POPL, pages 273–284. ACM, 2008.CrossRefGoogle Scholar
Hughes, Jack and Orchard, Dominic. Resourceful program synthesis from graded linear types. In Fernández, Maribel, editor, Proceedings of LOPSTR, volume 12561 of Lecture Notes in Computer Science, pages 151–170. Springer, 2020.Google Scholar
Hüttel, Hans. Transitions and Trees — An Introduction to Structural Operational Semantics. Cambridge University Press, 2010.CrossRefGoogle Scholar
Kiselyov, Oleg and Imai, Keigo. Session types without sophistry — system description. In Nakano, Keisuke and Sagonas, Konstantinos, editors, Proceedings of FLOPS, volume 12073 of Lecture Notes in Computer Science, pages 66–87. Springer, 2020.Google Scholar
Kobayashi, Naoki. Type systems for concurrent programs, 2007. www.kb.ecei.tohoku.ac.jp/~koba/papers/tutorial-type-extended.pdf.Google Scholar
Kokke, Wen. Rusty Variation: Deadlock-free sessions with failure in Rust. In Bartoletti, Massimo, Henrio, Ludovic, Mavridou, Anastasia, and Scalas, Alceste, editors, Proceedings of ICE, volume 304 of EPTCS, pages 48–60, 2019.CrossRefGoogle Scholar
Kokke, Wen and Dardha, Ornela. Deadlock-free session types in linear Haskell. In Hage, Jurriaan, editor, Proceedings of the Haskell Symposium, pages 1–13. ACM, 2021.Google Scholar
Kozen, Dexter and Silva, Alexandra. Practical coinduction. Math. Struct. Comput. Sci., 27(7):1132–1152, 2017.CrossRefGoogle Scholar
Lange, Julien and Yoshida, Nobuko. Characteristic formulae for session types. In Chechik, Marsha and Raskin, Jean-François, editors, Proceedings of TACAS, volume 9636 of Lecture Notes in Computer Science, pages 833–850. Springer, 2016.Google Scholar
Lindley, Sam and Morris, J. Garrett. A semantics for propositions as sessions. In Vitek, Jan, editor, Proceedings of ESOP, volume 9032 of Lecture Notes in Computer Science, pages 560–584. Springer, 2015.Google Scholar
Lindley, Sam and Morris, J. Garrett. Talking bananas: structural recursion for session types. In Garrigue, Jacques, Keller, Gabriele, and Sumii, Eijiro, editors, Proceedings of ICFP, pages 434–447. ACM, 2016.Google Scholar
The Links programming language. links-lang.org, 2005–2024.Google Scholar
Liskov, Barbara. Keynote address – data abstraction and hierarchy. In Power, Leigh R. and Weiss, Zvi, editors, Addendum to the Proceedings of OOPSLA, pages 17–34. ACM, 1987.Google Scholar
Mackie, Ian. Lilac: A functional programming language based on linear logic. J. Funct. Program., 4(4):395–433, 1994.CrossRefGoogle Scholar
Milner, Robin. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.Google Scholar
Milner, Robin, Parrow, Joachim, and Walker, David. A calculus of mobile processes, Inf. Comput., 100(1):1–40, 1992.CrossRefGoogle Scholar
Milner, Robin, Parrow, Joachim, and Walker, David. A calculus of mobile processes, Inf. Comput., 100(1):41–77, 1992.CrossRefGoogle Scholar
Mostrous, Dimitris and Vasconcelos, Vasco T.. Affine sessions. Log. Methods Comput. Sci., 14(4), 2018.Google Scholar
Mostrous, Dimitris and Yoshida, Nobuko. Session typing and asynchronous subtyping for the higher-order π-calculus. Inf. Comput., 241:227–263, 2015.CrossRefGoogle Scholar
Orchard, Dominic and Yoshida, Nobuko. Session types with linearity in Haskell. In Gay, Simon and Ravara, António, editors, Behavioural Types: from Theory to Tools. River Publishers, 2017.Google Scholar
Padovani, Luca. Deadlock and lock freedom in the linear π-calculus. In Henzinger, Thomas A. and Miller, Dale, editors, Proceedings of CSL-LICS, pages 72:1–72:10. ACM, 2014.Google Scholar
Padovani, Luca. A simple library implementation of binary sessions. J. Funct. Program., 27:e4, 2017.CrossRefGoogle Scholar
Palamidessi, Catuscia and Valencia, Frank D.. Recursion vs replication in process calculi: Expressiveness. Bull. EATCS, 87:105–125, 2005.Google Scholar
Pfenning, Frank and Griffith, Dennis. Polarized substructural session types. In Pitts, Andrew M., editor, Proceedings of FOSSACS, volume 9034 of Lecture Notes in Computer Science, pages 3–22. Springer, 2015.Google Scholar
Pierce, Benjamin C.. Types and programming languages. MIT Press, 2002.Google Scholar
Pierce, Benjamin C. and Sangiorgi, Davide. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci., 6(5):409–453, 1996.CrossRefGoogle Scholar
Pucella, Riccardo and Tov, Jesse A.. Haskell session types with (almost) no class. In Gill, Andy, editor, Proceedings of the Haskell Symposium, pages 25–36. ACM, 2008.Google Scholar
Rocha, Pedro and Caires, Luís. Safe session-based concurrency with shared linear state. In Wies, Thomas, editor, Proceedings of ESOP, volume 13990 of Lecture Notes in Computer Science, pages 421–450. Springer, 2023.Google Scholar
Sangiorgi, Davide. An Introduction to Bisimulation and Coinduction. Cambridge University Press, 2014.Google Scholar
Sangiorgi, Davide and Walker, David. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.Google Scholar
Sano, Chuta, Balzer, Stephanie, and Pfenning, Frank. Manifestly phased communication via shared session types. In Damiani, Ferruccio and Dardha, Ornela, editors, Proceedings of COORDINATION, volume 12717 of Lecture Notes in Computer Science, pages 23–40. Springer, 2021.Google Scholar
The SILL programming language. github.com/ISANobody/sill, 2015. Last accessed 2023.Google Scholar
Takeuchi, Kaku, Honda, Kohei, and Kubo, Makoto. An interaction-based language and its typing system. In Halatsis, Constantine, Maritsas, Dimitris G., Philokyprou, George, and Theodoridis, Sergios, editors, Proceedings of PARLE, volume 817 of Lecture Notes in Computer Science, pages 398–413. Springer, 1994.Google Scholar
Udomsrirungruang, Thien and Yoshida, Nobuko. Three subtyping algorithms for binary session types and their complexity analyses. In Costa, Diana and Hu, Raymond, editors, Proceedings of PLACES, volume 401 of Electronic Proceedings in Theoretical Computer Science, pages 49–60. Open Publishing Association, 2024.Google Scholar
Vasconcelos, Vasco T.. Fundamentals of session types. Inf. Comput., 217:52–70, 2012.CrossRefGoogle Scholar
Vieira, Hugo Torres and Vasconcelos, Vasco Thudichum. Typing progress in communication-centred systems. In Nicola, Rocco De and Julien, Christine, editors, Proceedings of COORDINATION, volume 7890 of Lecture Notes in Computer Science, pages 236–250. Springer, 2013.Google Scholar
Wadler, Philip. Propositions as sessions. J. Funct. Program., 24(2-3):384–418, 2014.CrossRefGoogle Scholar
Walker, David. Substructural type systems. In Pierce, Benjamin C., editor, Advanced Topics in Types and Programming Languages. MIT Press, 2005.Google Scholar
Willsey, Max, Prabhu, Rokhini, and Pfenning, Frank. Design and implementation of concurrent C0. In Cervesato, Iliano and Fernández, Maribel, editors, Proceedings of LINEARITY, volume 238 of EPTCS, pages 73–82, 2016.CrossRefGoogle Scholar
Wright, Andrew K. and Felleisen, Matthias. A syntactic approach to type soundness. Inf. Comput., 115(1):38–94, 1994.CrossRefGoogle Scholar

Accessibility standard: Unknown

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×