{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:19Z","timestamp":1750220179484,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["CoG 818616"],"award-info":[{"award-number":["CoG 818616"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3532469","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource approximation for the \u03bb\u03bc-calculus"],"prefix":"10.1145","author":[{"given":"Davide","family":"Barbarossa","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica - Scienza e Tecnologia, Universit\u00e0 di Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371069"},{"key":"e_1_3_2_1_2_1","unstructured":"Hendrik\u00a0Pieter Barendregt. 1984. The lambda calculus - its syntax and semantics. Studies in logic and the foundations of mathematics Vol.\u00a0103. North-Holland.  Hendrik\u00a0Pieter Barendregt. 1984. The lambda calculus - its syntax and semantics. Studies in logic and the foundations of mathematics Vol.\u00a0103. North-Holland."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90076-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646728.703369"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2019.09.005"},{"key":"e_1_3_2_1_6_1","volume-title":"28th EACSL Annual Conference on Computer Science Logic, CSL 2020","author":"Chouquet Jules","year":"2020","unstructured":"Jules Chouquet and Christine Tasson . 2020 . Taylor expansion for Call-By-Push-Value . In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 , January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2020.16 10.4230\/LIPIcs.CSL.2020.16 Jules Chouquet and Christine Tasson. 2020. Taylor expansion for Call-By-Push-Value. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.16"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2694930"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017475"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00392-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_14_1","volume-title":"1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016","author":"Guerrieri Giulio","year":"2016","unstructured":"Giulio Guerrieri , Luc Pellissier , and Lorenzo\u00a0Tortora de Falco . 2016 . Computing Connected Proof(-Structure)s From Their Taylor Expansion . In 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016 , June 22-26, 2016, Porto, Portugal(LIPIcs, Vol.\u00a052), Delia Kesnerand Brigitte Pientka (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 20:1\u201320:18. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD. 2016.20 10.4230\/LIPIcs.FSCD.2016.20 Giulio Guerrieri, Luc Pellissier, and Lorenzo\u00a0Tortora de Falco. 2016. Computing Connected Proof(-Structure)s From Their Taylor Expansion. In 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal(LIPIcs, Vol.\u00a052), Delia Kesnerand Brigitte Pientka (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 20:1\u201320:18. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2016.20"},{"key":"e_1_3_2_1_15_1","volume-title":"Taylor Expansion as Pullback. In Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC","author":"Guerrieri Giulio","year":"2019","unstructured":"Giulio Guerrieri , Luc Pellissier , and Lorenzo\u00a0Tortora de Falco . 2019. Proof-Net as Graph , Taylor Expansion as Pullback. In Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019 , Utrecht, The Netherlands , July 2-5, 2019, Proceedings(Lecture Notes in Computer Science, Vol.\u00a011541), Rosalie Iemhoff, Michael Moortgat, and Ruy J. G.\u00a0B. de\u00a0Queiroz (Eds.). Springer , 282\u2013300. https:\/\/doi.org\/10.1007\/978-3-662-59533-6_18 10.1007\/978-3-662-59533-6_18 Giulio Guerrieri, Luc Pellissier, and Lorenzo\u00a0Tortora de Falco. 2019. Proof-Net as Graph, Taylor Expansion as Pullback. In Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings(Lecture Notes in Computer Science, Vol.\u00a011541), Rosalie Iemhoff, Michael Moortgat, and Ruy J. G.\u00a0B. de\u00a0Queiroz (Eds.). Springer, 282\u2013300. https:\/\/doi.org\/10.1007\/978-3-662-59533-6_18"},{"key":"e_1_3_2_1_16_1","volume-title":"Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020","author":"Guerrieri Giulio","year":"2020","unstructured":"Giulio Guerrieri , Luc Pellissier , and Lorenzo\u00a0Tortora de Falco . 2020 . Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 , January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1\u201324:18. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2020.24 10.4230\/LIPIcs.CSL.2020.24 Giulio Guerrieri, Luc Pellissier, and Lorenzo\u00a0Tortora de Falco. 2020. Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1\u201324:18. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.24"},{"key":"e_1_3_2_1_17_1","volume-title":"Revisiting Call-by-value B\u00f6hm trees in light of their Taylor expansion. Log. Methods Comput. Sci. 16, 3","author":"Kerinec Emma","year":"2020","unstructured":"Emma Kerinec , Giulio Manzonetto , and Michele Pagani . 2020. Revisiting Call-by-value B\u00f6hm trees in light of their Taylor expansion. Log. Methods Comput. Sci. 16, 3 ( 2020 ). https:\/\/lmcs.episciences.org\/6638 Emma Kerinec, Giulio Manzonetto, and Michele Pagani. 2020. Revisiting Call-by-value B\u00f6hm trees in light of their Taylor expansion. Log. Methods Comput. Sci. 16, 3 (2020). https:\/\/lmcs.episciences.org\/6638"},{"key":"e_1_3_2_1_18_1","volume-title":"2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017","author":"Kesner Delia","year":"2017","unstructured":"Delia Kesner and Pierre Vial . 2017 . Types as Resources for Classical Natural Deduction . In 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 , September 3-9, 2017, Oxford, UK(LIPIcs, Vol.\u00a084), Dale Miller (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1\u201324:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD. 2017.24 10.4230\/LIPIcs.FSCD.2017.24 Delia Kesner and Pierre Vial. 2017. Types as Resources for Classical Natural Deduction. In 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK(LIPIcs, Vol.\u00a084), Dale Miller (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1\u201324:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.24"},{"key":"e_1_3_2_1_19_1","volume-title":"Realizability in classical logic. Panoramas et synth\u00e8ses 27","author":"Krivine Jean-Louis","year":"2009","unstructured":"Jean-Louis Krivine . 2009. Realizability in classical logic. Panoramas et synth\u00e8ses 27 ( 2009 ), 197\u2013229. https:\/\/hal.archives-ouvertes.fr\/hal-00154500 Jean-Louis Krivine. 2009. Realizability in classical logic. Panoramas et synth\u00e8ses 27 (2009), 197\u2013229. https:\/\/hal.archives-ouvertes.fr\/hal-00154500"},{"key":"e_1_3_2_1_20_1","unstructured":"Jean-Louis Krivine. 2020. A program for the full axiom of choice. arxiv:2006.05433\u00a0[cs.LO] https:\/\/arxiv.org\/abs\/2006.05433  Jean-Louis Krivine. 2020. A program for the full axiom of choice. arxiv:2006.05433\u00a0[cs.LO] https:\/\/arxiv.org\/abs\/2006.05433"},{"key":"e_1_3_2_1_21_1","volume-title":"4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019","author":"Lago Ugo\u00a0Dal","year":"2019","unstructured":"Ugo\u00a0Dal Lago and Thomas Leventis . 2019 . On the Taylor Expansion of Probabilistic lambda-terms . In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 , June 24-30, 2019, Dortmund, Germany(LIPIcs, Vol.\u00a0131), Herman Geuvers (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13:1\u201313:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD. 2019.13 10.4230\/LIPIcs.FSCD.2019.13 Ugo\u00a0Dal Lago and Thomas Leventis. 2019. On the Taylor Expansion of Probabilistic lambda-terms. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany(LIPIcs, Vol.\u00a0131), Herman Geuvers (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13:1\u201313:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00297-3"},{"key":"e_1_3_2_1_23_1","volume-title":"On the denotational semantics of the untyped lambda-mu calculus. (Jan","author":"Laurent Olivier","year":"2004","unstructured":"Olivier Laurent . 2004. On the denotational semantics of the untyped lambda-mu calculus. (Jan . 2004 ). http:\/\/perso.ens-lyon.fr\/olivier.laurent\/lmmodels.pdf Unpublished note. Olivier Laurent. 2004. On the denotational semantics of the untyped lambda-mu calculus. (Jan. 2004). http:\/\/perso.ens-lyon.fr\/olivier.laurent\/lmmodels.pdf Unpublished note."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061"},{"key":"e_1_3_2_1_25_1","unstructured":"Walter Py. 1998. Confluence en lambda-mu-calcul. Ph.D.Thesis Universit\u00e9 de Savoie(1998). http:\/\/www.lama.univ-savoie.fr\/pagesmembres\/david\/ftp\/py.pdf  Walter Py. 1998. Confluence en lambda-mu-calcul. Ph.D.Thesis Universit\u00e9 de Savoie(1998). http:\/\/www.lama.univ-savoie.fr\/pagesmembres\/david\/ftp\/py.pdf"},{"key":"e_1_3_2_1_26_1","volume-title":"10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06009)","author":"Saurin Alexis","year":"2010","unstructured":"Alexis Saurin . 2010 . Standardization and B\u00f6hm Trees for \u039b\u03bc-Calculus. In Functional and Logic Programming , 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06009) , Matthias Blume, Naoki Kobayashi, and Germ\u00e1n Vidal (Eds.). Springer, 134\u2013149. https:\/\/doi.org\/10.1007\/978-3-642-12251-4_11 10.1007\/978-3-642-12251-4_11 Alexis Saurin. 2010. Standardization and B\u00f6hm Trees for \u039b\u03bc-Calculus. In Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06009), Matthias Blume, Naoki Kobayashi, and Germ\u00e1n Vidal (Eds.). Springer, 134\u2013149. https:\/\/doi.org\/10.1007\/978-3-642-12251-4_11"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.027"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.028"},{"key":"e_1_3_2_1_30_1","volume-title":"Normalizing the Taylor expansion of non-deterministic \u03bb-terms, via parallel reduction of resource vectors. Log. Methods Comput. Sci. 15, 3","author":"Vaux Lionel","year":"2019","unstructured":"Lionel Vaux . 2019. Normalizing the Taylor expansion of non-deterministic \u03bb-terms, via parallel reduction of resource vectors. Log. Methods Comput. Sci. 15, 3 ( 2019 ). https:\/\/doi.org\/10.23638\/LMCS-15(3:9)2019 10.23638\/LMCS-15(3:9)2019 Lionel Vaux. 2019. Normalizing the Taylor expansion of non-deterministic \u03bb-terms, via parallel reduction of resource vectors. Log. Methods Comput. Sci. 15, 3 (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:9)2019"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532469","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3532469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":29,"alternative-id":["10.1145\/3531130.3532469","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3532469","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}