{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:48Z","timestamp":1772163948949,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,25]],"date-time":"2008-09-25T00:00:00Z","timestamp":1222300800000},"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":[[2008,9,25]]},"DOI":"10.1145\/1411286.1411296","type":"proceedings-article","created":{"date-parts":[[2008,9,30]],"date-time":"2008-09-30T09:03:19Z","timestamp":1222765399000},"page":"63-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Haskell, do you read me?"],"prefix":"10.1145","author":[{"given":"Marcos","family":"Viera","sequence":"first","affiliation":[{"name":"Universidad de la Rep\u00fablica, Montevideo, Uruguay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Doaitse","family":"Swierstra","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eelco","family":"Lempsink","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,9,25]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Utrecht University","author":"Baars Arthur","year":"2008","unstructured":"Arthur Baars and Doaitse Swierstra . Typed transformations of typed abstract syntax. http:\/\/www.cs.uu.nl\/research\/techreps\/ , Utrecht University , 2008 . Arthur Baars and Doaitse Swierstra. Typed transformations of typed abstract syntax. http:\/\/www.cs.uu.nl\/research\/techreps\/, Utrecht University, 2008."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005143"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017485"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.03.046"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.3115\/980845.980948"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/604174.604179"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016883"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-540-30175-2_8","volume-title":"Generative Programming and Component Engineering (GPCE'04)","author":"Pasalic Emir","year":"2004","unstructured":"Emir Pasalic and Nathan Linger . Meta-programming with typed object-language representations . In Generative Programming and Component Engineering (GPCE'04) , volume LNCS 3286 , pages 136 -- 167 , October 2004 . Emir Pasalic and Nathan Linger. Meta-programming with typed object-language representations. In Generative Programming and Component Engineering (GPCE'04), volume LNCS 3286, pages 136--167, October 2004."},{"key":"e_1_3_2_2_11_1","unstructured":"JC Petruzza Koen Claessen and Simon Peyton Jones. Derived read instances for recursive datatypes with infix constructors are too inefficient. URL http:\/\/hackage.haskell.org\/trac\/ghc\/ticket\/1544. GHC Ticket 1544.  JC Petruzza Koen Claessen and Simon Peyton Jones. Derived read instances for recursive datatypes with infix constructors are too inefficient. URL http:\/\/hackage.haskell.org\/trac\/ghc\/ticket\/1544. GHC Ticket 1544."},{"key":"e_1_3_2_2_12_1","volume-title":"Haskell 98 Language and Libraries: the Revised Report","author":"Jones Simon Peyton","year":"2003","unstructured":"Simon Peyton Jones . Haskell 98 Language and Libraries: the Revised Report . 2003 . Simon Peyton Jones. Haskell 98 Language and Libraries: the Revised Report. 2003."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1160074.1159811"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/581690.581691"},{"key":"e_1_3_2_2_15_1","unstructured":"S. D. Swierstra. The Utrecht Parsing Libraries. http:\/\/www.cs.uu.nl\/wiki\/bin\/view\/HUT\/ParserCombinators July 2008.  S. D. Swierstra. The Utrecht Parsing Libraries. http:\/\/www.cs.uu.nl\/wiki\/bin\/view\/HUT\/ParserCombinators July 2008."}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","location":"Victoria BC Canada","acronym":"ICFP08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the first ACM SIGPLAN symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411286.1411296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411286.1411296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:29:47Z","timestamp":1750238987000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411286.1411296"}},"subtitle":["constructing and composing efficient top-down parsers at runtime"],"short-title":[],"issued":{"date-parts":[[2008,9,25]]},"references-count":14,"alternative-id":["10.1145\/1411286.1411296","10.1145\/1411286"],"URL":"https:\/\/doi.org\/10.1145\/1411286.1411296","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1543134.1411296","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,9,25]]},"assertion":[{"value":"2008-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}