{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:10:58Z","timestamp":1767928258800,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642287282","type":"print"},{"value":"9783642287299","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_23","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"346-360","source":"Crossref","is-referenced-by-count":28,"title":["Functions as Session-Typed Processes"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"Toninho","sequence":"first","affiliation":[]},{"given":"Luis","family":"Caires","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Barber, A., Plotkin, G.: Dual Intuitionistic Linear Logic. Technical Report LFCS-96-347. Univ. of Edinburgh (1997)"},{"key":"23_CR2","unstructured":"Beffara, E.: Functions as proofs as processes. CoRR, abs\/1107.4160 (2011)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-45413-6_7","volume-title":"Typed Lambda Calculi and Applications","author":"M. Berger","year":"2001","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the \u03c0-Calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 29\u201345. Springer, Heidelberg (2001)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","volume":"195","author":"M. Boreale","year":"1998","unstructured":"Boreale, M.: On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science\u00a0195(2), 205\u2013226 (1998)","journal-title":"Theoretical Computer Science"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Boudol, G.: The lambda-calculus with multiplicities. Technical report, INRIA (1993)","DOI":"10.1007\/3-540-57208-2_1"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-15375-4_16","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L. Caires","year":"2010","unstructured":"Caires, L., Pfenning, F.: Session Types as Intuitionistic Linear Propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 222\u2013236. Springer, Heidelberg (2010)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-73228-0_12","volume-title":"Typed Lambda Calculi and Applications","author":"C. Faggian","year":"2007","unstructured":"Faggian, C., Piccolo, M.: Ludics is a Model for the Finitary Linear pi-Calculus. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 148\u2013162. Springer, Heidelberg (2007)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci.\u00a050, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: POPL 1992, Proceedings the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pp. 15\u201326 (1992)","DOI":"10.1145\/143165.143172"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"R.H. Halstead Jr.","year":"1985","unstructured":"Halstead Jr., R.H.: Multilisp: a language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst.\u00a07, 501\u2013538 (1985)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.tcs.2010.01.028","volume":"411","author":"K. Honda","year":"2010","unstructured":"Honda, K., Laurent, O.: An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comp. Sci.\u00a0411, 2223\u20132238 (2010)","journal-title":"Theor. Comp. Sci."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"Programming Languages and Systems","author":"K. Honda","year":"1998","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 122\u2013138. Springer, Heidelberg (1998)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"POPL 1990","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: POPL 1990, pp. 95\u2013108. ACM, New York (1990)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: POPL 1990, Proceedings the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pp. 16\u201330 (1990)","DOI":"10.1145\/96709.96711"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/S1571-0661(04)00022-2","volume":"1","author":"J. Maraist","year":"1995","unstructured":"Maraist, J., Odersky, M., Turner, D.N., Wadler, P.: Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Electr. Notes Theor. Comput. Sci.\u00a01, 370\u2013392 (1995)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11539452_6","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"D. Mazza","year":"2005","unstructured":"Mazza, D.: Multiport Interaction Nets and Concurrency. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 21\u201335. Springer, Heidelberg (2005)"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Math. Struct. in Comp. Sci.\u00a02(2), 119\u2013141 (1992)","journal-title":"Math. Struct. in Comp. Sci."},{"issue":"1&2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Pi-Calculus, Internal Mobility, and Agent Passing Calculi. Theoretical Computer Science\u00a0167(1&2), 235\u2013274 (1996)","journal-title":"Theoretical Computer Science"},{"key":"23_CR19","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Dependent session types via intuitionistic linear type theory. In: PPDP 2011, pp. 161\u2013172. ACM (2011)","DOI":"10.1145\/2003476.2003499"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-04081-8_7","volume-title":"CONCUR 2009 - Concurrency Theory","author":"S. Bakel van","year":"2009","unstructured":"van Bakel, S., Vigliotti, M.G.: A Logical Interpretation of the \u039b-Calculus into the \u03c0-Calculus. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 84\u201398. Springer, Heidelberg (2009)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-58027-1_24","volume-title":"Mathematical Foundations of Programming Semantics","author":"P. Wadler","year":"1994","unstructured":"Wadler, P.: A Syntax for Linear Logic. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 513\u2013529. Springer, Heidelberg (1994)"},{"key":"23_CR23","unstructured":"Wadsworth, C.: Semantics and Pragmatics of the Lambda Calculus. PhD thesis, Oxford University (1971)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:27Z","timestamp":1620126447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}