{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:50:44Z","timestamp":1780473044312,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031353604","type":"print"},{"value":"9783031353611","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35361-1_1","type":"book-chapter","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T14:04:07Z","timestamp":1686751447000},"page":"3-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Relating Message Passing and\u00a0Shared Memory, Proof-Theoretically"],"prefix":"10.1007","author":[{"given":"Frank","family":"Pfenning","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaas","family":"Pruiksma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"JM Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2(3), 197\u2013347 (1992)","journal-title":"J. Log. Comput."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0022251","volume-title":"Computer Science Logic","author":"PN Benton","year":"1995","unstructured":"Benton, P.N.: A mixed linear and non-linear logic: Proofs, terms and models. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 121\u2013135. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0022251"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s002240000117","volume":"32","author":"GE Blelloch","year":"1999","unstructured":"Blelloch, G.E., Reid-Miller, M.: Pipeling with futures. Theory Comput. Syst. 32, 213\u2013239 (1999)","journal-title":"Theory Comput. Syst."},{"key":"1_CR4","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). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_16"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Caires, L., Pfenning, F., Toninho, B.: Linear logic propositions as session types. Math. Struct. Comput. Sci. 26(3), 367\u2013423 (2016). Special Issue on Behavioural Types","DOI":"10.1017\/S0960129514000218"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. Theoret. Comput. Sci. 232(1\u20132), 133\u2013163 (2000). Special issue on Proof Search in Type-Theoretic Languages","DOI":"10.1016\/S0304-3975(99)00173-5"},{"issue":"10","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ic.2008.11.006","volume":"207","author":"I Cervesato","year":"2009","unstructured":"Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic. Inf. Comput. 207(10), 1044\u20131077 (2009)","journal-title":"Inf. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Curry, H.B.: Functionality in combinatory logic. Proceed. Nat. Acad. Sci. U.S.A. 20, 584\u2013590 (1934)","DOI":"10.1073\/pnas.20.11.584"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"DeYoung, H., Pfenning, F.: Data layout from a type-theoretic perspective. In: Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2022). Electronic Notes in Theoretical Informatics and Computer Science, vol. 1 (2022). https:\/\/arxiv.org\/abs\/2212.06321v6","DOI":"10.46298\/entics.10507"},{"key":"1_CR10","unstructured":"DeYoung, H., Pfenning, F., Pruiksma, K.: Semi-axiomatic sequent calculus. In: Ariola, Z. (ed.) 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), pp. 1\u201322. LIPIcs 167, Paris, France (2020)"},{"key":"1_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\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0014972","volume-title":"TAPSOFT \u201987","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y., Lafont, Y.: Linear logic and lazy computation. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) TAPSOFT 1987. LNCS, vol. 250, pp. 52\u201366. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0014972"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"RH Halstead","year":"1985","unstructured":"Halstead, R.H.: MultiLisp: a language for parallel symbolic computation. ACM Trans. Program. Lang. Syst. 7(4), 501\u2013539 (1985)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509\u2013523. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_35"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP\u201991 European Conference on Object-Oriented Programming","author":"K Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133\u2013147. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0057019"},{"key":"1_CR16","unstructured":"Howard, W.A.: The formulae-as-types notion of construction (1969), unpublished note. An annotated version appeared. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 479\u2013490, Academic Press (1980)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. In: Boehm, H.J., Steele, G. (eds.) Proceedings of the 23rd Symposium on Principles of Programming Languages (POPL1996), pp. 358\u2013371. ACM, St. Petersburg Beach, Florida, USA (1996)","DOI":"10.1145\/237721.237804"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Laurent, O.: Syntax vs. semantics: a polarized approach. Theoret. Comput. Sci. 343(1\u20132), 177\u2013206 (2005)","DOI":"10.1016\/j.tcs.2005.05.012"},{"key":"1_CR19","unstructured":"Milner, R.: Communicating and Mobile Systems: the $$\\pi $$-Calculus. Cambridge University Press (1999)"},{"key":"1_CR20","unstructured":"OpenMP. http:\/\/openmp.org"},{"key":"1_CR21","unstructured":"Pruiksma, K., Chargin, W., Pfenning, F., Reed, J.: Adjoint logic (2018). http:\/\/www.cs.cmu.edu\/~fp\/papers\/adjoint18b.pdf"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Pruiksma, K., Pfenning, F.: A message-passing interpretation of Adjoint logic. J. Logical Algebr. Methods Programm. 120, 100637 (2021)","DOI":"10.1016\/j.jlamp.2020.100637"},{"key":"1_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796822000016","volume":"32","author":"K Pruiksma","year":"2022","unstructured":"Pruiksma, K., Pfenning, F.: Back to futures. J. Funct. Program. 32, e6 (2022)","journal-title":"J. Funct. Program."},{"key":"1_CR24","unstructured":"Reed, J.: A judgmental deconstruction of modal logic (2009). http:\/\/www.cs.cmu.edu\/~jcreed\/papers\/jdml2.pdf"},{"key":"1_CR25","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-Calculus: a Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-28729-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"B Toninho","year":"2012","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Functions as session-typed processes. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 346\u2013360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_23"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time. In: Conference on Lisp and Functional Programming (LFP 1984), pp. 45\u201352. ACM, Austin, Texas (1984)","DOI":"10.1145\/800055.802020"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Propositions as sessions. In: Proceedings of the 17th International Conference on Functional Programming (ICFP 2012), pp. 273\u2013286. ACM Press, Copenhagen, Denmark (2012)","DOI":"10.1145\/2364527.2364568"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35361-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T14:04:16Z","timestamp":1686751456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35361-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031353604","9783031353611"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35361-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2023\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}