{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:15:59Z","timestamp":1750220159640,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T00:00:00Z","timestamp":1663632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,20]]},"DOI":"10.1145\/3551357.3551382","type":"proceedings-article","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T15:37:25Z","timestamp":1663688245000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Typed Lambda Calculus with Gradual Intersection Types"],"prefix":"10.1145","author":[{"given":"Pedro","family":"\u00c2ngelo","sequence":"first","affiliation":[{"name":"Faculdade de Ci\u00eancias & LIACC, Universidade do Porto, Portugal"}]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[{"name":"Faculdade de Ci\u00eancias & LIACC, Universidade do Porto, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2022,9,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236789"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926409"},{"key":"e_1_3_2_1_3_1","volume-title":"25th International Conference on Types for Proofs and Programs, TYPES 2019(LIPIcs, Vol.\u00a0175)","author":"Alves Sandra","year":"2019","unstructured":"Sandra Alves, Delia Kesner, and Daniel Ventura. 2019. A Quantitative Understanding of Pattern Matching. In 25th International Conference on Types for Proofs and Programs, TYPES 2019(LIPIcs, Vol.\u00a0175). 3:1\u20133:36."},{"key":"e_1_3_2_1_4_1","volume-title":"Gradual Intersection Types. In Ninth Workshop on Intersection Types and Related Systems, ITRS 2018","author":"\u00c2ngelo Pedro","year":"2018","unstructured":"Pedro \u00c2ngelo and M\u00e1rio Florido. 2018. Gradual Intersection Types. In Ninth Workshop on Intersection Types and Related Systems, ITRS 2018, Oxford, U.K., 8 July 2018. https:\/\/pedroangelo.github.io\/gradual-intersection-types.pdf"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47147-7_5"},{"key":"e_1_3_2_1_7_1","first-page":"2","article-title":"Rank 2 Intersection Type Assignment in Term Rewriting","volume":"26","author":"Bakel Steffen\u00a0van","year":"1996","unstructured":"Steffen\u00a0van Bakel. 1996. Rank 2 Intersection Type Assignment in Term Rewriting. Fundam. Inf. 26, 2 (May 1996), 141\u2013166.","journal-title":"Fundam. Inf."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-14(3:17)2018"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.046"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzx018"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.03.026"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110285"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290329"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993600.2996280"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837632"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009863"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"M. Coppo and M. Dezani-Ciancaglini. 1980. An extension of the basic functionality theory for the \u03bb-calculus.Notre Dame Journal of Formal Logic 21 4 (10 1980) 685\u2013693. https:\/\/doi.org\/10.1305\/ndjfl\/1093883253","DOI":"10.1305\/ndjfl"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646233.682244"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19810270205"},{"key":"e_1_3_2_1_21_1","volume-title":"Mathematical Foundations of Computer Science","author":"Cremet Vincent","year":"2006","unstructured":"Vincent Cremet, Fran\u00e7ois Garillot, Sergue\u00ef Lenglet, and Martin Odersky. 2006. A Core Calculus for Scala Type Checking. In Mathematical Foundations of Computer Science 2006, Rastislav Kr\u00e1lovi\u010dand Pawe\u0142 Urzyczyn (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1\u201323."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/778559.778560"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22348-9_6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676992"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837670"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237728"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784737"},{"key":"e_1_3_2_1_29_1","volume-title":"Non-idempotent types for classical calculi in natural deduction style. Log. Methods Comput. Sci. 16, 1","author":"Kesner Delia","year":"2020","unstructured":"Delia Kesner and Pierre Vial. 2020. Non-idempotent types for classical calculi in natural deduction style. Log. Methods Comput. Sci. 16, 1 (2020)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.032"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292556"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567077"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.03.005"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","unstructured":"Luigi Liquori and Claude Stolze. 2019. The Delta-calculus: Syntax and Types. In 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)(Leibniz International Proceedings in Informatics (LIPIcs) Vol.\u00a0131) Herman Geuvers (Ed.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik Dagstuhl Germany 28:1\u201328:20. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.28","DOI":"10.4230\/LIPIcs.FSCD.2019.28"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_3"},{"volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.\u00a0Hindley and J.\u00a0Seldin (Eds.)","author":"Pottinger G.","key":"e_1_3_2_1_36_1","unstructured":"G. Pottinger. 1980. A Type Assignment for the Strongly Normalizable Lambda-Terms. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.\u00a0Hindley and J.\u00a0Seldin (Eds.). Academic Press, 561\u2013577."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4118-8_9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80496-1"},{"key":"e_1_3_2_1_39_1","volume-title":"Scheme and Functional Programming Workshop, Vol.\u00a06. 81\u201392","author":"Siek G","year":"2006","unstructured":"Jeremy\u00a0G Siek and Walid Taha. 2006. Gradual typing for functional languages. In Scheme and Functional Programming Workshop, Vol.\u00a06. 81\u201392."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1408681.1408688"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SNAPL.2015.274"},{"volume-title":"Intersection type disciplines in lambda calculus and applicative term rewriting systems","author":"Van\u00a0Bakel Stephanus\u00a0Johannes","key":"e_1_3_2_1_42_1","unstructured":"Stephanus\u00a0Johannes Van\u00a0Bakel. 1993. Intersection type disciplines in lambda calculus and applicative term rewriting systems. Amsterdam: Mathematisch Centrum."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908110"},{"key":"e_1_3_2_1_44_1","volume-title":"Branching Types. In Proceedings of the 11th European Symposium on Programming Languages and Systems(ESOP \u201902)","author":"B.","year":"1968","unstructured":"Joe\u00a0B. Wells and Christian Haack. 2002. Branching Types. In Proceedings of the 11th European Symposium on Programming Languages and Systems(ESOP \u201902). Springer-Verlag, London, UK, UK, 115\u2013132. http:\/\/dl.acm.org\/citation.cfm?id=645396.651968"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276504"}],"event":{"name":"PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2022","location":"Tbilisi Georgia"},"container-title":["Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551357.3551382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551357.3551382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:24Z","timestamp":1750186824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551357.3551382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,20]]},"references-count":43,"alternative-id":["10.1145\/3551357.3551382","10.1145\/3551357"],"URL":"https:\/\/doi.org\/10.1145\/3551357.3551382","relation":{},"subject":[],"published":{"date-parts":[[2022,9,20]]},"assertion":[{"value":"2022-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}