{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:57Z","timestamp":1762458957732,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"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":[[2012,1,23]]},"DOI":"10.1145\/2103746.2103757","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:19Z","timestamp":1327423639000},"page":"39-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Ideas for connecting inductive program synthesis and bidirectionalization"],"prefix":"10.1145","author":[{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319634"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328409"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02408-5_19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232420.1232424"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706356.1706364"},{"key":"e_1_3_2_1_7_1","first-page":"111","volume-title":"Revised Selected Papers","author":"Katayama S.","year":"2007","unstructured":"S. Katayama . Systematic search for lambda expressions. In Trends in Functional Programming 2005 , Revised Selected Papers , pages 111 -- 126 . Intellect , 2007 . S. Katayama. Systematic search for lambda expressions. In Trends in Functional Programming 2005, Revised Selected Papers, pages 111--126. Intellect, 2007."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"174","volume-title":"Approaches and Applications of Inductive Programming","author":"Katayama S.","year":"2009","unstructured":"S. Katayama . Recent improvements of MagicHaskeller . In Approaches and Applications of Inductive Programming 2009 , Revised Papers, volume 5812 of LNCS , pages 174 -- 193 . Springer-Verlag , 2010. S. Katayama. Recent improvements of MagicHaskeller. In Approaches and Applications of Inductive Programming 2009, Revised Papers, volume 5812 of LNCS, pages 174--193. Springer-Verlag, 2010."},{"key":"e_1_3_2_1_9_1","first-page":"15","volume-title":"Approaches and Applications of Inductive Programming","author":"Kitzelmann E.","year":"2007","unstructured":"E. Kitzelmann . Data-driven induction of recursive functions from i\/o examples . In Approaches and Applications of Inductive Programming , Proceedings , pages 15 -- 26 , 2007 . E. Kitzelmann. Data-driven induction of recursive functions from i\/o examples. In Approaches and Applications of Inductive Programming, Proceedings, pages 15--26, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248562"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291162"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480904"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863571"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Philadelphia Pennsylvania USA","acronym":"POPL '12"},"container-title":["Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103746.2103757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:22Z","timestamp":1750241182000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":13,"alternative-id":["10.1145\/2103746.2103757","10.1145\/2103746"],"URL":"https:\/\/doi.org\/10.1145\/2103746.2103757","relation":{},"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}