{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:59Z","timestamp":1742913119061,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319309354"},{"type":"electronic","value":"9783319309361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30936-1_2","type":"book-chapter","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T20:27:44Z","timestamp":1459283264000},"page":"32-55","source":"Crossref","is-referenced-by-count":11,"title":["Conflation Confers Concurrency"],"prefix":"10.1007","author":[{"given":"Robert","family":"Atkey","sequence":"first","affiliation":[]},{"given":"Sam","family":"Lindley","sequence":"additional","affiliation":[]},{"given":"J. Garrett","family":"Morris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","volume":"135","author":"S Abramsky","year":"1992","unstructured":"Abramsky, S.: Proofs as processes. Theor. Comput. Sci. 135(1), 5\u20139 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Gay, S.J., Nagarajan, R.: Interaction categories and the foundations of typed concurrent programming. In: Proceedings of the NATO Advanced Study Institute on Deductive Program Design, Marktoberdorf, Germany, pp. 35\u2013113 (1996)","DOI":"10.1007\/978-3-642-61455-2_10"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0304-3975(94)00104-9","volume":"135","author":"G Bellin","year":"1994","unstructured":"Bellin, G., Scott, P.J.: On the $$\\pi $$ -Calculus and linear logic. Theoret. Comput. Sci. 135(1), 11\u201365 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR4","volume-title":"An Introduction to Functional Programming","author":"R Bird","year":"1988","unstructured":"Bird, R., Wadler, P.: An Introduction to Functional Programming. Prentice Hall International (UK) Ltd., Hertfordshire (1988)"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1073\/pnas.20.11.584","volume":"20","author":"HB Curry","year":"1934","unstructured":"Curry, H.B.: Functionality in combinatory logic. Proc. Nat. Acad. Sci. 20, 584\u2013590 (1934)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"2_CR7","unstructured":"Dardha, O., P\u00e9rez, J.A.: Comparing deadlock-free session typed processes. In: EXPRESS\/SOS, 2015, Madrid, Spain, 31 August 2015, pp. 1\u201315 (2015)"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.ic.2009.06.005","volume":"208","author":"T Ehrhard","year":"2010","unstructured":"Ehrhard, T., Laurent, O.: Interpreting a finitary pi-calculus in differential interaction nets. Inf. Comput. 208(6), 606\u2013633 (2010). http:\/\/dx.org\/10.1016\/j.ic.2009.06.005","journal-title":"Inf. Comput."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-73228-0_13","volume-title":"Typed Lambda Calculi and Applications","author":"MP Fiore","year":"2007","unstructured":"Fiore, M.P.: Differential structure in models of multiplicative biadditive intuitionistic linear logic. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 163\u2013177. Springer, Heidelberg (2007)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-662-44584-6_6","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 63\u201377. Springer, Heidelberg (2014)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1\u2013101 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 1993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715. Springer, Heidelberg (1993)"},{"issue":"22\u201324","key":"2_CR13","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. Comput. Sci. 411(22\u201324), 2223\u20132238 (2010). http:\/\/dx.doi.org\/10.1016\/j.tcs.2010.01.028","journal-title":"Theor. Comput. Sci."},{"key":"2_CR14","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":"2_CR15","unstructured":"Honda, K., Yoshida, N., Berger, M.: Control in the $$\\pi $$ -calculus. In: Fourth ACM-SIGPLAN Continuation Workshop, CW04, 2004. Online proceedings (2004)"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.jpaa.2007.05.021","volume":"212","author":"R Houston","year":"2008","unstructured":"Houston, R.: Finite products are biproducts in a compact closed category. J. Pure Appl. Algebra 212(2), 394\u2013400 (2008). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022404907001454","journal-title":"J. Pure Appl. Algebra"},{"key":"2_CR17","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"WA Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-types notion of construction. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, Boston (1980)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233\u2013247. Springer, Heidelberg (2006). http:\/\/dx.doi.org\/10.1007\/11817949_16"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the $$\\pi $$ -calculus. In: POPL. ACM (1996)","DOI":"10.1145\/237721.237804"},{"issue":"5","key":"2_CR20","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"PJ Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-46669-8_23","volume-title":"Programming Languages and Systems","author":"S Lindley","year":"2015","unstructured":"Lindley, S., Morris, J.G.: A semantics for propositions as sessions. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 560\u2013584. Springer, Heidelberg (2015)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Mazza, D.: The true concurrency of differential interaction nets. Mathematical Structures in Computer Science (2015, to appear)","DOI":"10.1017\/S0960129516000402"},{"key":"2_CR24","volume-title":"Java Generics and Collections","author":"M Naftalin","year":"2006","unstructured":"Naftalin, M., Wadler, P.: Java Generics and Collections. O\u2019Reilly Media, Inc., Sebastopol (2006)"},{"key":"2_CR25","unstructured":"Padovani, L.: Deadlock and lock freedom in the linear $$\\pi $$ -calculus. In: LICS. ACM (2014). http:\/\/doi.acm.org\/10.1145\/2603088.2603116"},{"key":"2_CR26","volume-title":"Formal Systems and Recursive Functions","author":"WW Tait","year":"1965","unstructured":"Tait, W.W.: Infinitely long terms of transfinite type. In: Crossley, J.N., Dummett, M.A.E. (eds.) Formal Systems and Recursive Functions. North-Holland, Amsterdam (1965)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"PARLE \u201994 Parallel Architectures and Languages Europe","author":"K Takeuchi","year":"1994","unstructured":"Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817. Springer, Heidelberg (1994)"},{"issue":"2\u20133","key":"2_CR28","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)","journal-title":"J. Funct. Program."},{"issue":"12","key":"2_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2699407","volume":"58","author":"P Wadler","year":"2015","unstructured":"Wadler, P.: Propositions as types. Commun. ACM 58(12), 75\u201384 (2015). http:\/\/doi.acm.org\/10.1145\/2699407","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","A List of Successes That Can Change the World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30936-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T11:26:13Z","timestamp":1692271573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30936-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319309354","9783319309361"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30936-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}