{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:42:35Z","timestamp":1742992955272,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983100"},{"type":"electronic","value":"9789819983117"}],"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-981-99-8311-7_6","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T07:02:17Z","timestamp":1700636537000},"page":"112-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Typed Non-determinism in\u00a0Functional and\u00a0Concurrent Calculi"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8264-7371","authenticated-orcid":false,"given":"Bas","family":"van den Heuvel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1711-9361","authenticated-orcid":false,"given":"Joseph W. N.","family":"Paulus","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1959-8730","authenticated-orcid":false,"given":"Daniele","family":"Nantes-Sobrinho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1452-6180","authenticated-orcid":false,"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-319-30936-1_2","volume-title":"A List of Successes That Can Change the World","author":"R Atkey","year":"2016","unstructured":"Atkey, R., Lindley, S., Morris, J.G.: Conflation confers concurrency. In: Lindley, S., McBride, C., Trinder, P., Sannella, D. (eds.) A List of Successes That Can Change the World. LNCS, vol. 9600, pp. 32\u201355. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30936-1_2"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Berger, M., Honda, K.: The two-phase commitment protocol in an extended pi-calculus. In: Aceto, L., Victor, B. (eds.) 7th International Workshop on Expressiveness in Concurrency, EXPRESS 2000, Satellite Workshop of CONCUR 2000, State College, PA, USA, 21 August 2000. Electronic Notes in Theoretical Computer Science, vol. 39, pp. 21\u201346. Elsevier (2000). https:\/\/doi.org\/10.1016\/S1571-0661(05)82502-2","DOI":"10.1016\/S1571-0661(05)82502-2"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57208-2_1","volume-title":"CONCUR\u201993","author":"G Boudol","year":"1993","unstructured":"Boudol, G.: The lambda-calculus with multiplicities. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 1\u20136. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_1"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Boudol, G., Laneve, C.: Lambda-calculus, multiplicities, and the pi-calculus. In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 659\u2013690 (2000)","DOI":"10.7551\/mitpress\/5641.003.0032"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-662-54434-1_9","volume-title":"Programming Languages and Systems","author":"L Caires","year":"2017","unstructured":"Caires, L., P\u00e9rez, J.A.: Linearity, control effects, and behavioral types. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 229\u2013259. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_9"},{"key":"6_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. 6269, pp. 222\u2013236. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_16"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Casal, F., Mordido, A., Vasconcelos, V.T.: Mixed sessions. Theor. Comput. Sci. 897, 23\u201348 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2021.08.005","DOI":"10.1016\/j.tcs.2021.08.005"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"de\u2019Liguoro, U., Piperno, A.: Non deterministic extensions of untyped lambda-calculus. Inf. Comput. 122(2), 149\u2013177 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1145","DOI":"10.1006\/inco.1995.1145"},{"key":"6_CR9","unstructured":"Dezani-Ciancaglini, M.: Logical semantics for concurrent lambda-calculus. Ph.D. thesis, Nijmegen University (1996). https:\/\/www.di.unito.it\/~dezani\/papers\/tesi.ps"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theor. Comput. Sci. 309(1\u20133), 1\u201341 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00392-X","DOI":"10.1016\/S0304-3975(03)00392-X"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press (2014). https:\/\/mitpress.mit.edu\/books\/modeling-and-analysis-communicating-systems","DOI":"10.7551\/mitpress\/9946.001.0001"},{"key":"6_CR13","unstructured":"van den Heuvel, B., Paulus, J.W.N., Nantes-Sobrinho, D., P\u00e9rez, J.A.: Typed non-determinism in functional and concurrent calculi (extended version). CoRR abs\/2205.00680 (2022). https:\/\/doi.org\/10.48550\/arXiv.2205.00680"},{"key":"6_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":"6_CR15","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). https:\/\/doi.org\/10.1007\/BFb0053567"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Kokke, W., Morris, J.G., Wadler, P.: Towards races in linear logic. Log. Meth. Comput. Sci. 16(4) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(4:15)2020","DOI":"10.23638\/LMCS-16(4:15)2020"},{"key":"6_CR17","unstructured":"Milner, R.: Functions as processes. Research Report 1154, INRIA, Sophia Antipolis (1990). Final version appeared as [18]"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2(2), 119\u2013141 (1992). https:\/\/doi.org\/10.1017\/S0960129500001407","DOI":"10.1017\/S0960129500001407"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. I. Inf. Comput. 100(1), 1\u201340 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-45187-7_26","volume-title":"CONCUR 2003 - Concurrency Theory","author":"U Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R., Merro, M.: Modeling consensus in a process calculus. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 399\u2013414. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45187-7_26"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-12032-9_25","volume-title":"Foundations of Software Science and Computational Structures","author":"M Pagani","year":"2010","unstructured":"Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FoSSaCS 2010. LNCS, vol. 6014, pp. 358\u2013373. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12032-9_25"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Paulus, J.W.N., Nantes-Sobrinho, D., P\u00e9rez, J.A.: Non-deterministic functions as non-deterministic processes. In: Kobayashi, N. (ed.) 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, Buenos Aires, Argentina (Virtual Conference), 17\u201324 July 2021. LIPIcs, vol. 195, pp. 21:1\u201321:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2021.21, Extended version on https:\/\/arxiv.org\/abs\/2104.14759","DOI":"10.4230\/LIPIcs.FSCD.2021.21"},{"key":"6_CR23","unstructured":"Peters, K.: Translational expressiveness. Comparing process calculi using encodings. Ph.D. thesis, Berlin Institute of Technology (2012). https:\/\/doi.org\/10.14279\/depositonce-3416"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Peters, K.: Comparing process calculi using encodings. In: P\u00e9rez, J.A., Rot, J. (eds.) Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2019, Amsterdam, The Netherlands, 26th August 2019. EPTCS, vol. 300, pp. 19\u201338 (2019). https:\/\/doi.org\/10.4204\/EPTCS.300.2","DOI":"10.4204\/EPTCS.300.2"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Rocha, P., Caires, L.: Propositions-as-types and shared state. Proc. ACM Program. Lang. 5(ICFP), 79:1\u201379:30 (2021). https:\/\/doi.org\/10.1145\/3473584","DOI":"10.1145\/3473584"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Rocha, P., Caires, L.: Safe session-based concurrency with shared linear state. In: Wies, T. (ed.) Programming Languages and Systems. LNCS, vol. 2072, pp. 421\u2013450. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30044-8_16","DOI":"10.1007\/978-3-031-30044-8_16"},{"key":"6_CR27","volume-title":"The Pi-Calculus - A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"6_CR28","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":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/978-3-319-89884-1_29","volume-title":"Programming Languages and Systems","author":"B Toninho","year":"2018","unstructured":"Toninho, B., Yoshida, N.: On polymorphic sessions and functions. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 827\u2013855. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_29"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-030-44914-8_26","volume-title":"Programming Languages and Systems","author":"VT Vasconcelos","year":"2020","unstructured":"Vasconcelos, V.T., Casal, F., Almeida, B., Mordido, A.: Mixed sessions. In: ESOP 2020. LNCS, vol. 12075, pp. 715\u2013742. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_26"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Propositions as sessions. In: Thiemann, P., Findler, R.B. (eds.) ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, Copenhagen, Denmark, 9\u201315 September 2012, pp. 273\u2013286. ACM (2012). https:\/\/doi.org\/10.1145\/2364527.2364568","DOI":"10.1145\/2364527.2364568"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8311-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T16:25:24Z","timestamp":1730564724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8311-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819983100","9789819983117"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8311-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"26 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","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":"15","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":"0","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":"47% - 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":"4","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)"}}]}}