{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:01:17Z","timestamp":1790744477150,"version":"4.1.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452308","type":"print"},{"value":"9783030452315","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present the spinal atomic <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus, a typed <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus with explicit sharing and atomic duplication that achieves spinal full laziness: duplicating only the direct paths between a binder and bound variables is enough for beta reduction to proceed. We show this calculus is the result of a Curry\u2013Howard style interpretation of a deep-inference proof system, and prove that it has natural properties with respect to the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus: confluence and preservation of strong normalisation.<\/jats:p>","DOI":"10.1007\/978-3-030-45231-5_30","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"582-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Spinal Atomic Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"David","family":"Sherratt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Willem","family":"Heijltjes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Gundersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Parigot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P.L., L\u00e9vy, J.J.: Explicit substitutions. Journal of Functional Programming 1(4), 375\u2013416 (1991)","journal-title":"Journal of Functional Programming"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Kesner, D.: Preservation of strong normalisation modulo permutations for the structural lambda-calculus. Logical Methods in Computer Science 8(1) (2012)","DOI":"10.2168\/LMCS-8(1:28)2012"},{"key":"30_CR3","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press (1998)"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/2103621.2103713","volume":"47","author":"T Balabonski","year":"2012","unstructured":"Balabonski, T.: A unified approach to fully lazy sharing. ACM SIGPLAN Notices 47(1), 469\u2013480 (2012)","journal-title":"ACM SIGPLAN Notices"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Balabonski, T.: Weak Optimality, and the Meaning of Sharing. In: International Conference on Functional Programming (ICFP). pp. 263\u2013274. Boston, United States (Sep 2013). https:\/\/doi.org\/10.1145\/2500365.2500606, https:\/\/hal.archives-ouvertes.fr\/hal-00907056","DOI":"10.1145\/2500365.2500606"},{"key":"30_CR6","unstructured":"Barendregt, H.P.: The Lambda Calculus \u2013 Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland (1984)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0019-9958(82)90458-2","volume":"55","author":"KJ Berkling","year":"1982","unstructured":"Berkling, K.J., Fehr, E.: A consistent extension of the lambda-calculus as a base for functional programming languages. Information and Control 55, 89\u2013101 (1982)","journal-title":"Information and Control"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Blanc, T., L\u00e9vy, J.J., Maranget, L.: Sharing in the weak lambda-calculus. Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday 3838, 70 (2005)","DOI":"10.1007\/11601548_7"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Br\u00fcnnler, K., McKinley, R.: An algorithmic interpretation of a deep inference system. In: International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR). pp. 482\u2013496 (2008)","DOI":"10.1007\/978-3-540-89439-1_34"},{"key":"30_CR10","unstructured":"Br\u00fcnnler, K., Tiu, A.: A local system for classical logic. In: 8th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR). LNCS, vol. 2250, pp. 347\u2013361 (2001)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Church, A., Rosser, J.B.: Some properties of conversion. Transactions of the American Mathematical Society 39(3), 472\u2013482 (1936), http:\/\/www.jstor.org\/stable\/1989762","DOI":"10.1090\/S0002-9947-1936-1501858-0"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0022-4049(95)00160-3","volume":"114","author":"R Cockett","year":"1997","unstructured":"Cockett, R., Seely, R.: Weakly distributive categories. Journal of Pure and Applied Algebra 114(2), 133\u2013173 (1997)","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-005-0169-9","volume":"15","author":"M Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Mackie, I., Sinot, F.R.: Lambda-calculus with director strings. Applicable Algebra in Engineering, Communication and Computing 15(6), 393\u2013437 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Guenot, N., Stra\u00dfburger, L.: Symmetric normalisation for intuitionistic logic. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) (2014)","DOI":"10.1145\/2603088.2603160"},{"key":"30_CR15","unstructured":"Guglielmi, A., Gundersen, T., Parigot, M.: A proof calculus which reduces syntactic bureaucracy. In: 21st International Conference on Rewriting Techniques and Applications (RTA). pp. 135\u2013150 (2010)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Gundersen, T., Heijltjes, W., Parigot, M.: Atomic lambda-calculus: a typed lambda-calculus with explicit sharing. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). pp. 311\u2013320 (2013)","DOI":"10.1109\/LICS.2013.37"},{"key":"30_CR17","unstructured":"He, F.: The Atomic Lambda-Mu Calculus. Ph.D. thesis, University of Bath (2018)"},{"key":"30_CR18","unstructured":"Hendriks, D., van Oostrom, V.: Adbmal. In: 19th International Conference on Automated Deduction (CADE). LNCS, vol. 2741, pp. 136\u2013150 (2003)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Kennaway, R., Sleep, R.: Director strings as combinators. ACM Transactions on Programming Languages and Systems (1988)","DOI":"10.1145\/48022.48026"},{"key":"30_CR20","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Ph.D. thesis, Utrecht University (1980)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. pp. 16\u201330 (1990)","DOI":"10.1145\/96709.96711"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL). pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"key":"30_CR23","unstructured":"L\u00e9vy, J.J.: Optimal reductions in the lambda-calculus. In: To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism. Academic Press (1980)"},{"key":"30_CR24","unstructured":"van Oostrom, V., van de Looij, K.J., Zwitserlood, M.: Lambdascope: another optimal implementation of the lambda-calculus. In: Workshop on Algebra and Logic on Programming Systems (ALPS) (2004)"},{"key":"30_CR25","unstructured":"Sherratt, D.R.: A lambda-calculus that achieves full laziness with spine duplication. Ph.D. thesis, University of Bath (2019)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Tiu, A.: A local system for intuitionistic logic. In: International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR). pp. 242\u2013256 (2006)","DOI":"10.1007\/11916277_17"},{"key":"30_CR27","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics of the Lambda-Calculus. Ph.D. thesis, University of Oxford (1971)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45231-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T14:06:09Z","timestamp":1610028369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45231-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452308","9783030452315"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45231-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fossacs","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":"98","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":"31","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":"32% - 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":"12","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)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}