{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:17:04Z","timestamp":1748405824234,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":40,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819789429"},{"type":"electronic","value":"9789819789436"}],"license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"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":[[2025]]},"DOI":"10.1007\/978-981-97-8943-6_5","type":"book-chapter","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T08:45:29Z","timestamp":1730105129000},"page":"84-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Quantitative Pattern-Matching Paradigm"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Ramos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Barras, B.: The negligible and yet subtle cost of pattern matching. In: Chang, B.E. (ed.) Programming Languages and Systems - 15th Asian Symposium, APLAS 2017, Suzhou, China, November 27-29, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10695, pp. 426\u2013447. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-71237-6_21","DOI":"10.1007\/978-3-319-71237-6_21"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/S095679682000012X","volume":"30","author":"B Accattoli","year":"2020","unstructured":"Accattoli, B., Graham-Lengrand, S., Kesner, D.: Tight typings and split bounds, fully developed. J. Funct. Program. 30, e14 (2020). https:\/\/doi.org\/10.1017\/S095679682000012X","journal-title":"J. Funct. Program."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/JIGPAL\/JZX059","volume":"26","author":"S Alves","year":"2018","unstructured":"Alves, S., Dundua, B., Florido, M., Kutsia, T.: Pattern-based calculi with finitary matching. Log. J. IGPL 26(2), 203\u2013243 (2018). https:\/\/doi.org\/10.1093\/JIGPAL\/JZX059","journal-title":"Log. J. IGPL"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alves, S., Kesner, D., Ramos, M.: Extending the quantitative pattern-matching paradigm (full version) (2024). https:\/\/arxiv.org\/abs\/2408.11007","DOI":"10.1007\/978-981-97-8943-6_5"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Alves, S., Kesner, D., Ventura, D.: A quantitative understanding of pattern matching. In: Bezem, M., Mahboubi, A. (eds.) 25th International Conference on Types for Proofs and Programs (TYPES 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0175, pp. 3:1\u20133:36. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020).https:\/\/doi.org\/10.4230\/LIPIcs.TYPES.2019.3","DOI":"10.4230\/LIPIcs.TYPES.2019.3"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Barenbaum, P., Bonelli, E., Mohamed, K.: Pattern matching and fixed points: resource types and strong call-by-need: extended abstract. In: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, pp. 1\u201312. ACM, Frankfurt am Main Germany (2018). https:\/\/doi.org\/10.1145\/3236950.3236972","DOI":"10.1145\/3236950.3236972"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Bono, V., Dezani-Ciancaglini, M.: A tale of intersection types. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS \u201920: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, Saarbr\u00fccken, Germany, 8\u201311 July 2020, pp. 7\u201320. ACM (2020).https:\/\/doi.org\/10.1145\/3373718.3394733","DOI":"10.1145\/3373718.3394733"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Bucciarelli, A., Kesner, D., R\u00edos, A., Viso, A.: The bang calculus revisited. Inf. Comput. 293, 105047 (2023). https:\/\/doi.org\/10.1016\/J.IC.2023.105047","DOI":"10.1016\/J.IC.2023.105047"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Bucciarelli, A., Kesner, D., Rocca, S.R.D.: Observability for pair pattern calculi. In: Altenkirch, T. (ed.) 13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015, 1\u20133 July 2015, Warsaw, Poland. LIPIcs, vol.\u00a038, pp. 123\u2013137. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015https:\/\/doi.org\/10.4230\/LIPICS.TLCA.2015.123","DOI":"10.4230\/LIPICS.TLCA.2015.123"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Bucciarelli, A., Kesner, D., Rocca, S.R.D.: Inhabitation for non-idempotent intersection types. Log. Methods Comput. Sci. 14(3) (2018).https:\/\/doi.org\/10.23638\/LMCS-14(3:7)2018","DOI":"10.23638\/LMCS-14(3:7)2018"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Kesner, D., Rocca, S.R.D.: Solvability = typability + inhabitation. Log. Methods Comput. Sci. 17(1) (2021), https:\/\/lmcs.episciences.org\/7141","DOI":"10.23638\/LMCS-17(1:7)2021"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1093\/JIGPAL\/JZX018","volume":"25","author":"A Bucciarelli","year":"2017","unstructured":"Bucciarelli, A., Kesner, D., Ventura, D.: Non-idempotent intersection types for the lambda-calculus. Log. J. IGPL 25(4), 431\u2013464 (2017). https:\/\/doi.org\/10.1093\/JIGPAL\/JZX018","journal-title":"Log. J. IGPL"},{"key":"5_CR13","unstructured":"de Carvalho, D.: S\u00e9mantiques de la logique lin\u00e9aire et temps de calcul. Universit\u00e9 Aix-Marseille II, These de doctorat (2007)"},{"issue":"7","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1017\/S0960129516000396","volume":"28","author":"D de Carvalho","year":"2018","unstructured":"de Carvalho, D.: Execution time of $$\\lambda $$-terms via denotational semantics and intersection types. Math. Struct. Comput. Sci. 28(7), 1169\u20131203 (2018). https:\/\/doi.org\/10.1017\/S0960129516000396","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Cerrito, S., Kesner, D.: Pattern matching as cut elimination. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2\u20135 July 1999, pp. 98\u2013108. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/LICS.1999.782596","DOI":"10.1109\/LICS.1999.782596"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1093\/JIGPAL\/9.3.339","volume":"9","author":"H Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus - part I. Log. J. IGPL 9(3), 339\u2013375 (2001). https:\/\/doi.org\/10.1093\/JIGPAL\/9.3.339","journal-title":"Log. J. IGPL"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type assignment for $$\\lambda $$-terms. Arch. Math. Log. 19(1), 139\u2013156 (1978). https:\/\/doi.org\/10.1007\/BF02011875","journal-title":"Arch. Math. Log."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type assignment for lambda-terms. Archiv f\u00fcr Math. Logik 19, 139\u2013156 (1978)","journal-title":"Archiv f\u00fcr Math. Logik"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Gardner, P.: Discovering needed reductions using type theory. In: Hagiya, M., Mitchell, J.C. (eds.) Theoretical Aspects of Computer Software, International Conference TACS \u201994, Sendai, Japan, 19\u201322 April 1994, Proceedings. Lecture Notes in Computer Science, vol.\u00a0789, pp. 555\u2013574. Springer (1994).https:\/\/doi.org\/10.1007\/3-540-57887-0_115","DOI":"10.1007\/3-540-57887-0_115"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR21","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), 1\u2013101 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Gr\u00e9goire, B., Leroy, X.: A compiled implementation of strong reduction. In: Wand, M., Jones, S.L.P. (eds.) Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP \u201902), Pittsburgh, Pennsylvania, USA, 4\u20136 Oct 2002, pp. 235\u2013246. ACM (2002).https:\/\/doi.org\/10.1145\/581478.581501","DOI":"10.1145\/581478.581501"},{"key":"5_CR23","unstructured":"Huet, G., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems - Part I and Part II. In: Lassez, J.L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, pp. 395\u2013443. MIT Press (1991)"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0956796808007144","volume":"19","author":"CB Jay","year":"2009","unstructured":"Jay, C.B., Kesner, D.: First-class patterns. J. Funct. Program. 19(2), 191\u2013225 (2009). https:\/\/doi.org\/10.1017\/S0956796808007144","journal-title":"J. Funct. Program."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Kahl, W.: Basic pattern matching calculi: a fresh view on matching failure. In: Kameyama, Y., Stuckey, P.J. (eds.) Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, 7\u20139 Apr 2004, Proceedings. Lecture Notes in Computer Science, vol.\u00a02998, pp. 276\u2013290. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24754-8_20","DOI":"10.1007\/978-3-540-24754-8_20"},{"key":"5_CR26","unstructured":"Kesner, D.: Reasoning about redundant patterns. J. Funct. Log. Program. 1997(4) (1997). http:\/\/danae.uni-muenster.de\/lehre\/kuchen\/JFLP\/articles\/1997\/A97-04\/A97-04.html"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/INCO.1996.0004","volume":"124","author":"D Kesner","year":"1996","unstructured":"Kesner, D., Puel, L., Tannen, V.: A typed pattern calculus. Inf. Comput. 124(1), 32\u201361 (1996). https:\/\/doi.org\/10.1006\/INCO.1996.0004","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR28","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/LOGCOM\/10.3.411","volume":"10","author":"AJ Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus and consequences. J. Log. Comput. 10(3), 411\u2013436 (2000). https:\/\/doi.org\/10.1093\/LOGCOM\/10.3.411","journal-title":"J. Log. Comput."},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Kfoury, A.J., Wells, J.B.: Principality and decidable type inference for finite-rank intersection types. In: Appel, A.W., Aiken, A. (eds.) POPL \u201999, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, TX, USA, 20\u201322 Jan 1999, pp. 161\u2013174. ACM (1999). https:\/\/doi.org\/10.1145\/292540.292556","DOI":"10.1145\/292540.292556"},{"key":"5_CR30","unstructured":"Khasidashvili, Z.: Expression reduction systems. In: Proceedings of IN Vekua Institute of Applied Mathematics. vol.\u00a036. Tbilisi (1990)"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Krishnaswami, N.R.: Focusing on pattern matching. In: Shao, Z., Pierce, B.C. (eds.) Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, 21\u201323 Jan 2009, pp. 366\u2013378. ACM (2009). https:\/\/doi.org\/10.1145\/1480881.1480927","DOI":"10.1145\/1480881.1480927"},{"issue":"1\u20133","key":"5_CR32","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/J.TCS.2008.01.044","volume":"398","author":"UD Lago","year":"2008","unstructured":"Lago, U.D., Martini, S.: The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1\u20133), 32\u201350 (2008). https:\/\/doi.org\/10.1016\/J.TCS.2008.01.044","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17(3), 348\u2013375 (1978). https:\/\/doi.org\/10.1016\/0022-0000(78)90014-4","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS \u201989), Pacific Grove, California, USA, 5\u20138 June 1989, pp. 14\u201323. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/LICS.1989.39155","DOI":"10.1109\/LICS.1989.39155"},{"issue":"1","key":"5_CR35","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","journal-title":"Inf. Comput."},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Neergaard, P.M., Mairson, H.G.: Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In: Okasaki, C., Fisher, K. (eds.) Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP 2004, Snow Bird, UT, USA, 19\u201321 Sept 2004, pp. 138\u2013149. ACM (2004). https:\/\/doi.org\/10.1145\/1016850.1016871","DOI":"10.1145\/1016850.1016871"},{"issue":"2","key":"5_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"GD Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975). https:\/\/doi.org\/10.1016\/0304-3975(75)90017-1","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR38","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/INCO.1993.1026","volume":"104","author":"RC Sekar","year":"1993","unstructured":"Sekar, R.C., Ramakrishnan, I.V.: Programming in equational logic: Beyond strong sequentiality. Inf. Comput. 104(1), 78\u2013109 (1993). https:\/\/doi.org\/10.1006\/INCO.1993.1026","journal-title":"Inf. Comput."},{"key":"5_CR39","unstructured":"Terese: Term Rewriting Systems, Cambridge tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Zeilberger, N.: Focusing and higher-order abstract syntax. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, 7\u201312 Jan 2008, pp. 359\u2013369. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328482","DOI":"10.1145\/1328438.1328482"}],"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-97-8943-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T16:52:39Z","timestamp":1748364759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8943-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"ISBN":["9789819789429","9789819789436"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8943-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"28 October 2024","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":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}