{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:03Z","timestamp":1772164023816,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T00:00:00Z","timestamp":1285545600000},"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":[[2010,9,27]]},"DOI":"10.1145\/1863543.1863594","type":"proceedings-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T13:41:50Z","timestamp":1285681310000},"page":"357-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["A play on regular expressions"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Fischer","sequence":"first","affiliation":[{"name":"Christian-Albrechts University of Kiel, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Huch","sequence":"additional","affiliation":[{"name":"Christian-Albrechts University of Kiel, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wilke","sequence":"additional","affiliation":[{"name":"Christian-Albrechts University of Kiel, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9,27]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_10"},{"key":"e_1_3_2_2_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-45007-6_14","volume-title":"Z. \u00c9sik and Z","author":"Caron P.","year":"2003","unstructured":"}} P. Caron and M. Flouret . From Glushkov WFAs to rational expressions . In Z. \u00c9sik and Z . F\u00fcl\u00f6p, editors, Developments in Language Theory, 7th International Conference (DLT 2003 ), Szeged, Hungary, volume 2710 of Lecture Notes in Computer Science , pages 183 -- 193 . Springer , 2003. }}P. Caron and M. Flouret. From Glushkov WFAs to rational expressions. In Z. \u00c9sik and Z. F\u00fcl\u00f6p, editors, Developments in Language Theory, 7th International Conference (DLT 2003), Szeged, Hungary, volume 2710 of Lecture Notes in Computer Science, pages 183--193. Springer, 2003."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1667106"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02531491"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321254"},{"key":"e_1_3_2_2_6_1","unstructured":"}}Haskell Wiki. Haskell - regular expressions. http:\/\/www.haskell.org\/haskellwiki\/Regular_expressions.  }}Haskell Wiki. Haskell - regular expressions. http:\/\/www.haskell.org\/haskellwiki\/Regular_expressions."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1238844.1238856"},{"key":"e_1_3_2_2_8_1","first-page":"3","volume-title":"Automata Studies","author":"Kleene S.","year":"1956","unstructured":"}} S. Kleene . Representation of events in nerve nets and finite automata . In C. Shannon and J. McCarthy, editors, Automata Studies , pages 3 -- 42 . Princeton University Press , Princeton, N.J. , 1956 . }}S. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 3--42. Princeton University Press, Princeton, N.J., 1956."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"}],"event":{"name":"ICFP '10: ACM SIGPLAN International Conference on Functional Programming","location":"Baltimore Maryland USA","acronym":"ICFP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863543.1863594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1863543.1863594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:39:52Z","timestamp":1750232392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863543.1863594"}},"subtitle":["functional pearl"],"short-title":[],"issued":{"date-parts":[[2010,9,27]]},"references-count":12,"alternative-id":["10.1145\/1863543.1863594","10.1145\/1863543"],"URL":"https:\/\/doi.org\/10.1145\/1863543.1863594","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1932681.1863594","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,9,27]]},"assertion":[{"value":"2010-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}