{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:22Z","timestamp":1750309342771,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,29]]},"DOI":"10.1145\/3677999.3678275","type":"proceedings-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T19:13:35Z","timestamp":1724872415000},"page":"14-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Higher Order Patterns for Rewrite Rules"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6837-3757","authenticated-orcid":false,"given":"Jaro","family":"Reinders","sequence":"first","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00402-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543728.2543736"},{"key":"e_1_3_2_1_4_1","unstructured":"The GHC Team. 2024. The Glasgow Haskell Compiler. https:\/\/www.haskell.org\/ghc\/"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_6_1","unstructured":"The Haskell 2010 committee. 2010. Haskell 2010 Language Report. https:\/\/www.haskell.org\/onlinereport\/haskell2010\/"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009880"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom"},{"volume-title":"Unification of simply typed lambda-terms as logic programming","author":"Miller Dale","key":"e_1_3_2_1_9_1","unstructured":"Dale Miller. 1991. Unification of simply typed lambda-terms as logic programming. University of Pennsylvania Department of Computer and Information Science. https:\/\/repository.upenn.edu\/handle\/20.500.14332\/7376"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.48456\/tr-218"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0037114"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3215-8_17"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291200"},{"key":"e_1_3_2_1_14_1","volume-title":"2001 Haskell Workshop (2001 haskell workshop ed.). https:\/\/www.microsoft.com\/en-us\/research\/publication\/playing-by-the-rules-rewriting-as-a-practical-optimisation-technique-in-ghc\/","author":"Jones Simon Peyton","year":"2001","unstructured":"Simon Peyton Jones, Andrew Tolmach, and Tony Hoare. 2001. Playing by the rules: rewriting as a practical optimisation technique in GHC. In 2001 Haskell Workshop (2001 haskell workshop ed.). https:\/\/www.microsoft.com\/en-us\/research\/publication\/playing-by-the-rules-rewriting-as-a-practical-optimisation-technique-in-ghc\/"},{"volume-title":"Compilation by transformation for non-strict functional languages. Ph. D. Dissertation","author":"Santos Andre","key":"e_1_3_2_1_15_1","unstructured":"Andre Santos. 1995. Compilation by transformation for non-strict functional languages. Ph. D. Dissertation. University of Glasgow (United Kingdom). https:\/\/theses.gla.ac.uk\/id\/eprint\/74568"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"}],"event":{"name":"Haskell '24: 17th ACM SIGPLAN International Haskell Symposium","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Milan Italy","acronym":"Haskell '24"},"container-title":["Proceedings of the 17th ACM SIGPLAN International Haskell Symposium"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677999.3678275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677999.3678275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:28Z","timestamp":1750291468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677999.3678275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":16,"alternative-id":["10.1145\/3677999.3678275","10.1145\/3677999"],"URL":"https:\/\/doi.org\/10.1145\/3677999.3678275","relation":{},"subject":[],"published":{"date-parts":[[2024,8,28]]},"assertion":[{"value":"2024-08-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}