{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:57:23Z","timestamp":1725724643577},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,9,30]]},"DOI":"10.1145\/1863523.1863525","type":"proceedings-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T17:41:50Z","timestamp":1285695710000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Invertible syntax descriptions"],"prefix":"10.1145","author":[{"given":"Tillmann","family":"Rendel","sequence":"first","affiliation":[{"name":"University of Marburg, Marburg, Germany"}]},{"given":"Klaus","family":"Ostermann","sequence":"additional","affiliation":[{"name":"University of Marburg, Marburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2010,9,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-36377-7_13","volume-title":"The essence of computation: complexity, analysis, transformation","author":"Abramov Sergei","year":"2002","unstructured":"}} Sergei Abramov and Robert Gl\u00fcck . Principles of inverse computation and the universal resolving algorithm . In The essence of computation: complexity, analysis, transformation , pages 269 -- 295 . Springer LNCS 2566, New York, 2002 . }}Sergei Abramov and Robert Gl\u00fcck. Principles of inverse computation and the universal resolving algorithm. In The essence of computation: complexity, analysis, transformation, pages 269--295. Springer LNCS 2566, New York, 2002."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088348.1088357"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-009-9049-5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.006"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003104"},{"key":"e_1_3_2_2_6_1","first-page":"66","volume-title":"Advanced Functional Programming","author":"Danvy Olivier","year":"2008","unstructured":"}} Olivier Danvy . From reduction-based to reduction-free normalization . In Advanced Functional Programming , pages 66 -- 164 . Springer LNCS 5832, 2008 . }}Olivier Danvy. From reduction-based to reduction-free normalization. In Advanced Functional Programming, pages 66--164. Springer LNCS 5832, 2008."},{"key":"e_1_3_2_2_7_1","first-page":"1","volume-title":"Advanced Functional Programming, First International Spring School, number 925 in LNCS","author":"Fokker J.","year":"1995","unstructured":"}} J. Fokker . Functional parsers . In J. T. Jeuring and H. J. M. Meijer, editors, Advanced Functional Programming, First International Spring School, number 925 in LNCS , pages 1 -- 23 , 1995 . }}J. Fokker. Functional parsers. In J. T. Jeuring and H. J. M. Meijer, editors, Advanced Functional Programming, First International Spring School, number 925 in LNCS, pages 1--23, 1995."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411257"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040325"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004367"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449913.1449935"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647698.734154"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003050"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645393.651884"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(01)00020-X"},{"key":"e_1_3_2_2_17_1","volume-title":"category extras: Various modules and constructs inspired by category theory.","author":"Kmett Edward A.","year":"2008","unstructured":"}} Edward A. Kmett . category extras: Various modules and constructs inspired by category theory. Available at http:\/\/hackage.haskell.org\/package\/category-extras, 2008 . }}Edward A. Kmett. category extras: Various modules and constructs inspired by category theory. Available at http:\/\/hackage.haskell.org\/package\/category-extras, 2008."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27764-4_16"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411213"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/636517.636528"}],"event":{"name":"ICFP '10: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Baltimore Maryland USA","acronym":"ICFP '10"},"container-title":["Proceedings of the third ACM Haskell symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1863523.1863525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:05:42Z","timestamp":1693865142000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863523.1863525"}},"subtitle":["unifying parsing and pretty printing"],"short-title":[],"issued":{"date-parts":[[2010,9,30]]},"references-count":21,"alternative-id":["10.1145\/1863523.1863525","10.1145\/1863523"],"URL":"https:\/\/doi.org\/10.1145\/1863523.1863525","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2088456.1863525","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,9,30]]},"assertion":[{"value":"2010-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}