{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:13:16Z","timestamp":1743099196636,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395692"},{"type":"electronic","value":"9783319395708"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39570-8_16","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T05:04:10Z","timestamp":1464066250000},"page":"239-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Challenge of Typed Expressiveness in Concurrency"],"prefix":"10.1007","author":[{"given":"Jorge A.","family":"P\u00e9rez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"16_CR1","unstructured":"Flow: A Static Type Checker for JavaScript. \n                    http:\/\/flowtype.org"},{"key":"16_CR2","unstructured":"The Erlang Programming Language. \n                    http:\/\/www.erlang.org"},{"key":"16_CR3","unstructured":"The Go Programming Language. \n                    https:\/\/golang.org"},{"key":"16_CR4","unstructured":"The Rust Programming Language. \n                    https:\/\/www.rust-lang.org"},{"key":"16_CR5","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: mobile processes, nominal data, and logic. In: Proceedings of LICS 2009, pp. 39\u201348. IEEE Computer Society (2009). \n                    http:\/\/doi.ieeecomputersociety.org\/10.1109\/LICS.2009.20"},{"issue":"6","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S096012950999017X","volume":"19","author":"N Busi","year":"2009","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Math. Struc. Comp. Sci. 19(6), 1191\u20131222 (2009). \n                    http:\/\/dx.doi.org\/10.1017\/S096012950999017X","journal-title":"Math. Struc. Comp. Sci."},{"key":"16_CR7","unstructured":"Caires, L., P\u00e9rez, J.A.: A typeful characterization of multiparty structured conversations based on binary sessions. CoRR abs\/1407.4242 (2014). \n                    http:\/\/arxiv.org\/abs\/1407.4242"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-319-39570-8_6","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"Lu\u00eds Caires","year":"2016","unstructured":"Caires, L., P\u00e9rez, J.A.: Multiparty session types within a canonical binary theory, and beyond. In: Albert, E., Lanese, I. (eds.) FORTE 2016. LNCS, vol. 9688, pp. 75\u201385. Springer, Heidelberg (2016)"},{"key":"16_CR9","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. 6269, pp. 222\u2013236. Springer, Heidelberg (2010)"},{"key":"16_CR10","unstructured":"Cano, M., Rueda, C., L\u00f3pez, H.A., P\u00e9rez, J.A.: Declarative interpretations of session-based concurrency. In: Proceedings of PPDP 2015, pp. 67\u201378. ACM (2015). \n                    http:\/\/doi.acm.org\/10.1145\/2790449.2790513"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-43376-8_4","volume-title":"Coordination Models and Languages","author":"M Carbone","year":"2014","unstructured":"Carbone, M., Dardha, O., Montesi, F.: Progress as compositional lock-freedom. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 49\u201364. Springer, Heidelberg (2014). \n                    http:\/\/dx.doi.org\/10.1007\/978-3-662-43376-8_4"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.4204\/EPTCS.38.4","volume":"38","author":"Marco Carbone","year":"2010","unstructured":"Carbone, M., Debois, S.: A graphical approach to progress for structured communication in web services. In: Proceedings of ICE 2010. EPTCS, vol. 38, pp. 13\u201327 (2010). \n                    http:\/\/dx.doi.org\/10.4204\/EPTCS.38.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"1","key":"16_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/2480359.2429101","volume":"48","author":"Marco Carbone","year":"2013","unstructured":"Carbone, M., Montesi, F.: Deadlock-freedom-by-design: multiparty asynchronous global programming. In: Proceedings of POPL 2013, pp. 263\u2013274. ACM (2013). \n                    http:\/\/doi.acm.org\/10.1145\/2429069.2429101","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR14","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C., Yoshida, N.: Multiparty session types as coherence proofs. In: Proceedings of CONCUR 2015. LIPIcs, vol. 42, pp. 412\u2013426 (2015). \n                    http:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2015.412"},{"key":"16_CR15","unstructured":"Cruz-Filipe, L., Montesi, F.: Choreographies, computationally. CoRR abs\/1510.03271 (2015). \n                    http:\/\/arxiv.org\/abs\/1510.03271"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.4204\/EPTCS.162.4","volume":"162","author":"Ornela Dardha","year":"2014","unstructured":"Dardha, O.: Recursive session types revisited. In: Proceedings of BEAT 2014. EPTCS, vol. 162, pp. 27\u201334 (2014). \n                    http:\/\/dx.doi.org\/10.4204\/EPTCS.162.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"16_CR17","unstructured":"Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: Proceedings of PPDP 2012, pp. 139\u2013150. ACM (2012). \n                    http:\/\/doi.acm.org\/10.1145\/2370776.2370794"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4204\/EPTCS.190.1","volume":"190","author":"Ornela Dardha","year":"2015","unstructured":"Dardha, O., P\u00e9rez, J.A.: Comparing deadlock-free session typed processes. In: Proceedings of EXPRESS\/SOS. EPTCS, vol. 190, pp. 1\u201315 (2015). \n                    http:\/\/dx.doi.org\/10.4204\/EPTCS.190.1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23217-6_19","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R Demangeon","year":"2011","unstructured":"Demangeon, R., Honda, K.: Full abstraction in a subtyped pi-calculus with linear types. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 280\u2013296. Springer, Heidelberg (2011). \n                    http:\/\/dx.org\/10.1007\/978-3-642-23217-6_19"},{"key":"16_CR20","unstructured":"Demangeon, R., Yoshida, N.: On the expressiveness of multiparty sessions. In: Proceedings of FSTTCS 2015. LIPIcs, vol. 45, pp. 560\u2013574. Schloss Dagstuhl (2015). \n                    http:\/\/dx.org\/10.4230\/LIPIcs.FSTTCS.2015.560"},{"issue":"7","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y Deng","year":"2006","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Inf. Comput. 204(7), 1045\u20131082 (2006)","journal-title":"Inf. Comput."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-28869-2_10","volume-title":"Programming Languages and Systems","author":"P-M Deni\u00e9lou","year":"2012","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 194\u2013213. Springer, Heidelberg (2012). \n                    http:\/\/dx.org\/10.1007\/978-3-642-28869-2_10"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-642-39212-2_18","volume-title":"Automata, Languages, and Programming","author":"P-M Deni\u00e9lou","year":"2013","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty compatibility in communicating automata: characterisation and synthesis of global session types. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 174\u2013186. Springer, Heidelberg (2013). \n                    http:\/\/dx.org\/10.1007\/978-3-642-39212-2_18"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14458-5_1","volume-title":"Web Services and Formal Methods","author":"M Dezani-Ciancaglini","year":"2010","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U.: Sessions and session types: an overview. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 1\u201328. Springer, Heidelberg (2010)"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-78663-4_18","volume-title":"Trustworthy Global Computing","author":"M Dezani-Ciancaglini","year":"2008","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U., Yoshida, N.: On progress for structured communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 257\u2013275. Springer, Heidelberg (2008). \n                    http:\/\/dx.org\/10.1007\/978-3-540-78663-4_18"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-662-45917-1_8","volume-title":"Trustworthy Global Computing","author":"L Fossati","year":"2014","unstructured":"Fossati, L., Hu, R., Yoshida, N.: Multiparty session nets. In: Maffei, M., Tuosto, E. (eds.) TGC 2014. LNCS, vol. 8902, pp. 112\u2013127. Springer, Heidelberg (2014). \n                    http:\/\/dx.org\/10.1007\/978-3-662-45917-1_8"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"S Gay","year":"2005","unstructured":"Gay, S., Hole, M.: Subtyping for session types in the pi calculus. Acta Inf. 42, 191\u2013225 (2005). \n                    http:\/\/portal.acm.org\/citation.cfm?id=1104643.1104646","journal-title":"Acta Inf."},{"key":"16_CR28","doi-asserted-by":"crossref","first-page":"94","DOI":"10.4204\/EPTCS.160.9","volume":"160","author":"Simon J. Gay","year":"2014","unstructured":"Gay, S.J., Gesbert, N., Ravara, A.: Session types as generic process types. In: Proceedings of EXPRESS 2014 and SOS 2014. EPTCS, vol. 160, pp. 94\u2013110 (2014). \n                    http:\/\/dx.org\/10.4204\/EPTCS.160.9","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1017\/S0956796809990268","volume":"20","author":"SJ Gay","year":"2010","unstructured":"Gay, S.J., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Program. 20(1), 19\u201350 (2010). \n                    http:\/\/dx.org\/10.1017\/S0956796809990268","journal-title":"J. Funct. Program."},{"issue":"9","key":"16_CR30","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). \n                    http:\/\/dx.org\/10.1016\/j.ic.2010.05.002","journal-title":"Inf. Comput."},{"key":"16_CR31","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. 1381, pp. 122\u2013138. Springer, Heidelberg (1998)"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL 2008, pp. 273\u2013284. ACM (2008)","DOI":"10.1145\/1328897.1328472"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-23217-6_18","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"H H\u00fcttel","year":"2011","unstructured":"H\u00fcttel, H.: Typed $$\\psi $$-calculi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 265\u2013279. Springer, Heidelberg (2011). \n                    http:\/\/dx.doi.org\/10.1007\/978-3-642-23217-6_18"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-05119-2_6","volume-title":"Trustworthy Global Computing","author":"H H\u00fcttel","year":"2014","unstructured":"H\u00fcttel, H.: Types for resources in $$\\psi $$-calculi. In: Abadi, M., Lluch Lafuente, A. (eds.) TGC 2013. LNCS, vol. 8358, pp. 83\u2013102. Springer, Heidelberg (2014). \n                    http:\/\/dx.org\/10.1007\/978-3-319-05119-2_6"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Huttel, H., Lanese, I., Vasconcelos, V., Caires, L., Carbone, M., Deni\u00e9lou, P.M., Mostrous, D., Padovani, L., Ravara, A., Tuosto, E., Vieira, H.T., Zavattaro, G.: Foundations of session types and behavioural contracts. ACM Comput. Surv. (2016, to appear)","DOI":"10.1145\/2873052"},{"issue":"1\u20133","key":"16_CR36","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(03)00325-6","volume":"311","author":"A Igarashi","year":"2004","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. Theor. Comput. Sci. 311(1\u20133), 121\u2013163 (2004). \n                    http:\/\/dx.org\/10.1016\/S0304-3975(03)00325\u20136","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"16_CR37","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","volume":"177","author":"N Kobayashi","year":"2002","unstructured":"Kobayashi, N.: A type system for lock-free processes. Inf. Comput. 177(2), 122\u2013159 (2002). \n                    http:\/\/dx.org\/10.1006\/inco.2002.3171","journal-title":"Inf. Comput."},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-40007-3_26","volume-title":"Formal Methods at the Crossroads. From Panacea to Foundational Support","author":"N Kobayashi","year":"2003","unstructured":"Kobayashi, N.: Type systems for concurrent programs. In: Aichernig, B.K. (ed.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 439\u2013453. Springer, Heidelberg (2003). \n                    http:\/\/dx.org\/10.1007\/978-3-540-40007-3_26"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. In: POPL, pp. 358\u2013371 (1996)","DOI":"10.1145\/237721.237804"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-662-49498-1_18","volume-title":"Programming Languages and Systems","author":"D Kouzapas","year":"2016","unstructured":"Kouzapas, D., P\u00e9rez, J.A., Yoshida, N.: On the relative expressiveness of higher-order session processes. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 446\u2013475. Springer, Heidelberg (2016). doi:\n                    10.1007\/978-3-662-49498-1_18"},{"issue":"1","key":"16_CR41","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/2775051.2676964","volume":"50","author":"Julien Lange","year":"2015","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: Proceedings of POPL 2015, pp. 221\u2013232. ACM (2015). \n                    http:\/\/doi.acm.org\/10.1145\/2676726.2676964","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4204\/EPTCS.17.1","volume":"17","author":"Hugo A. L\u00f3pez","year":"2010","unstructured":"L\u00f3pez, H.A., Olarte, C., P\u00e9rez, J.A.: Towards a unified framework for declarative structured communications. In: Proceedings of PLACES 2009. EPTCS, vol. 17, pp. 1\u201315 (2009). \n                    http:\/\/dx.org\/10.4204\/EPTCS.17.1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"16_CR43","unstructured":"Milner, R.: The Polyadic pi-Calculus: A Tutorial. Technical report, ECS-LFCS-91-180 (1991)"},{"issue":"2","key":"16_CR44","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. Struc. Comp. Sci. 2(2), 119\u2013141 (1992)","journal-title":"Math. Struc. Comp. Sci."},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11817949_4","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"U Nestmann","year":"2006","unstructured":"Nestmann, U.: Welcome to the jungle: a subjective guide to mobile process calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 52\u201363. Springer, Heidelberg (2006). \n                    http:\/\/dx.org\/10.1007\/11817949_4"},{"issue":"1","key":"16_CR46","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/2914770.2837634","volume":"51","author":"Dominic Orchard","year":"2016","unstructured":"Orchard, D.A., Yoshida, N.: Effects as sessions, sessions as effects. In: Proceedings of POPL 2016, pp. 568\u2013581. ACM (2016). \n                    http:\/\/doi.acm.org\/10.1145\/2837614.2837634","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR47","doi-asserted-by":"crossref","first-page":"71","DOI":"10.4204\/EPTCS.45.6","volume":"45","author":"Luca Padovani","year":"2011","unstructured":"Padovani, L.: Session types = intersection types + union types. In: Proceedings of ITRS 2010. EPTCS, vol. 45, pp. 71\u201389 (2010). \n                    http:\/\/dx.org\/10.4204\/EPTCS.45.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"5","key":"16_CR48","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Struct. Comput. Sci. 13(5), 685\u2013719 (2003). \n                    http:\/\/dx.org\/10.1017\/S0960129503004043","journal-title":"Math. Struct. Comput. Sci."},{"key":"16_CR49","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.entcs.2008.04.011","volume":"209","author":"Joachim Parrow","year":"2008","unstructured":"Parrow, J.: Expressiveness of process algebras. In: ENTCS, vol. 209, pp. 173\u2013186 (2008). \n                    http:\/\/dx.org\/10.1016\/j.entcs.2008.04.011","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"16_CR50","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D. thesis CST-99-93, University of Edinburgh (1992)"},{"key":"16_CR51","unstructured":"Villard, J.: Heaps and Hops. Ph.D. thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan, February 2011"},{"issue":"2\u20133","key":"16_CR52","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1017\/S095679681400001X","volume":"24","author":"P Wadler","year":"2014","unstructured":"Wadler, P.: Propositions as sessions. J. Funct. Program. 24(2\u20133), 384\u2013418 (2014). \n                    http:\/\/dx.org\/10.1017\/S095679681400001X","journal-title":"J. Funct. Program."},{"key":"16_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-62034-6_64","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"N Yoshida","year":"1996","unstructured":"Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 371\u2013386. Springer, Heidelberg (1996). \n                    http:\/\/dx.org\/10.1007\/3-540-62034-6_64"},{"issue":"2","key":"16_CR54","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N Yoshida","year":"2004","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi -calculus. Inf. Comput. 191(2), 145\u2013202 (2004)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39570-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T00:10:06Z","timestamp":1590192606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39570-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395692","9783319395708"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39570-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}