{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:24Z","timestamp":1772163984118,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T00:00:00Z","timestamp":1379894400000},"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":[[2013,9,23]]},"DOI":"10.1145\/2503778.2503781","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T15:57:05Z","timestamp":1379433425000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Understanding idiomatic traversals backwards and forwards"],"prefix":"10.1145","author":[{"given":"Richard","family":"Bird","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Gibbons","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Mehner","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[{"name":"Ghent University, Gent, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/648084.747162"},{"key":"e_1_3_2_1_2_1","volume-title":"Free applicative functors","author":"Capriotti P.","year":"2013","unstructured":"P. Capriotti and A. Kaposi . Free applicative functors . University of Nottingham. http :\/\/paolocapriotti.com\/blog\/ 2013 \/04\/03\/free-applicative-functors\/, Apr. 2013. P. Capriotti and A. Kaposi. Free applicative functors. University of Nottingham. http:\/\/paolocapriotti.com\/blog\/2013\/04\/03\/free-applicative-functors\/, Apr. 2013."},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-540-24849-1_14","volume-title":"Types for Proofs and Programs","author":"Gambino N.","year":"2004","unstructured":"N. Gambino and M. Hyland . Wellfounded trees and dependent polynomial functors . In Types for Proofs and Programs , volume 3085 of Lecture Notes in Computer Science , pages 210 -- 225 . Springer , 2004 . 10.1007\/978-3-540-24849-1_14. N. Gambino and M. Hyland. Wellfounded trees and dependent polynomial functors. In Types for Proofs and Programs, volume 3085 of Lecture Notes in Computer Science, pages 210--225. Springer, 2004. 10.1007\/978-3-540-24849-1_14."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007291"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(88)90025-5"},{"key":"e_1_3_2_1_6_1","volume-title":"Nijmegen","author":"Hutton G.","year":"2008","unstructured":"G. Hutton and D. Fulger . Reasoning About Effects: Seeing the Wood Through the Trees. In Trends in Functional Programming, pre-proceedings , Nijmegen , The Netherlands , 2008 . G. Hutton and D. Fulger. Reasoning About Effects: Seeing the Wood Through the Trees. In Trends in Functional Programming, pre-proceedings, Nijmegen, The Netherlands, 2008."},{"key":"e_1_3_2_1_7_1","series-title":"Electronic Proceedings in Theoretical Computer Science","first-page":"40","volume-title":"Mathematically Structured Functional Programming","author":"Jaskelioff M.","year":"2012","unstructured":"M. Jaskelioff and O. Ryp\u00e1cek . An investigation of the laws of traversals . In Mathematically Structured Functional Programming , volume 76 of Electronic Proceedings in Theoretical Computer Science , pages 40 -- 49 , 2012 . 10.4204\/EPTCS.76.5. M. Jaskelioff and O. Ryp\u00e1cek. An investigation of the laws of traversals. In Mathematically Structured Functional Programming, volume 76 of Electronic Proceedings in Theoretical Computer Science, pages 40--49, 2012. 10.4204\/EPTCS.76.5."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80316-0"},{"key":"e_1_3_2_1_10_1","unstructured":"R. O'Connor and M. Jaskelioff. On the static nature of traversals. http:\/\/r6.ca\/blog\/20121209T182914Z.html Dec. 2012.  R. O'Connor and M. Jaskelioff. On the static nature of traversals. http:\/\/r6.ca\/blog\/20121209T182914Z.html Dec. 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"Manuscript","author":"Ryp\u00e1cek O.","year":"2010","unstructured":"O. Ryp\u00e1cek . Labelling polynomial functors: A coherent approach . Manuscript , Mar. 2010 . O. Ryp\u00e1cek. Labelling polynomial functors: A coherent approach. Manuscript, Mar. 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596577"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503781","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503778.2503781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:27Z","timestamp":1750217307000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,23]]},"references-count":13,"alternative-id":["10.1145\/2503778.2503781","10.1145\/2503778"],"URL":"https:\/\/doi.org\/10.1145\/2503778.2503781","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578854.2503781","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,23]]},"assertion":[{"value":"2013-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}