{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:50:25Z","timestamp":1775868625357,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T00:00:00Z","timestamp":1537142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100009193","name":"Royal Society","doi-asserted-by":"publisher","award":["IES\\R3\\170104"],"award-info":[{"award-number":["IES\\R3\\170104"]}],"id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Japan Society for the Promotion of Science","award":["15K15966, 15H02681"],"award-info":[{"award-number":["15K15966, 15H02681"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,17]]},"DOI":"10.1145\/3242744.3242758","type":"proceedings-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T08:11:39Z","timestamp":1537258299000},"page":"158-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Embedding invertible languages with binders: a case of the FliPpr language"],"prefix":"10.1145","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[{"name":"Tohoku University, Japan"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Bristol, UK"}]}],"member":"320","published-online":{"date-parts":[[2018,9,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"TLCA (Lecture Notes in Computer Science), Pierre-Louis Curien (Ed.)","author":"Atkey Robert","unstructured":"Robert Atkey . 2009. Syntax for Free: Representing Syntax with Binding Using Parametricity . In TLCA (Lecture Notes in Computer Science), Pierre-Louis Curien (Ed.) , Vol. 5608 . Springer , 35-49. Robert Atkey. 2009. Syntax for Free: Representing Syntax with Binding Using Parametricity. In TLCA (Lecture Notes in Computer Science), Pierre-Louis Curien (Ed.), Vol. 5608. Springer, 35-49."},{"key":"e_1_3_2_1_2_1","first-page":"37","article-title":"Unembedding domain-specific languages. In Haskell, Stephanie Weirich (Ed.)","author":"Atkey Robert","year":"2009","unstructured":"Robert Atkey , Sam Lindley , and Jeremy Yallop . 2009 . Unembedding domain-specific languages. In Haskell, Stephanie Weirich (Ed.) . ACM , 37 - 48 . Robert Atkey, Sam Lindley, and Jeremy Yallop. 2009. Unembedding domain-specific languages. In Haskell, Stephanie Weirich (Ed.). ACM, 37-48.","journal-title":"ACM"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.08.031"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_1_5_1","first-page":"143","article-title":"Parametric higher-order abstract syntax for mechanized semantics. In ICFP, James Hook and Peter Thiemann (Eds.)","author":"Chlipala Adam","year":"2008","unstructured":"Adam Chlipala . 2008 . Parametric higher-order abstract syntax for mechanized semantics. In ICFP, James Hook and Peter Thiemann (Eds.) . ACM , 143 - 156 . Adam Chlipala. 2008. Parametric higher-order abstract syntax for mechanized semantics. In ICFP, James Hook and Peter Thiemann (Eds.). ACM, 143-156.","journal-title":"ACM"},{"key":"e_1_3_2_1_6_1","first-page":"268","article-title":"QuickCheck: a lightweight tool for random testing of Haskell programs. In ICFP, Martin Odersky and Philip Wadler (Eds.)","author":"Claessen Koen","year":"2000","unstructured":"Koen Claessen and John Hughes . 2000 . QuickCheck: a lightweight tool for random testing of Haskell programs. In ICFP, Martin Odersky and Philip Wadler (Eds.) . ACM , 268 - 279 . Koen Claessen and John Hughes. 2000. QuickCheck: a lightweight tool for random testing of Haskell programs. In ICFP, Martin Odersky and Philip Wadler (Eds.). ACM, 268-279.","journal-title":"ACM"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Correct-by-construction pretty-printing. In DTP, Stephanie Weirich (Ed.)","author":"Danielsson Nils Anders","year":"2013","unstructured":"Nils Anders Danielsson . 2013 . Correct-by-construction pretty-printing. In DTP, Stephanie Weirich (Ed.) . ACM , 1 - 12 . Nils Anders Danielsson. 2013. Correct-by-construction pretty-printing. In DTP, Stephanie Weirich (Ed.). ACM, 1-12.","journal-title":"ACM"},{"key":"e_1_3_2_1_8_1","first-page":"107","article-title":"Embedded parser generators. In Haskell, Koen Claessen (Ed.)","author":"Dureg\u00e5rd Jonas","year":"2011","unstructured":"Jonas Dureg\u00e5rd and Patrik Jansson . 2011 . Embedded parser generators. In Haskell, Koen Claessen (Ed.) . ACM , 107 - 117 . Jonas Dureg\u00e5rd and Patrik Jansson. 2011. Embedded parser generators. In Haskell, Koen Claessen (Ed.). ACM, 107-117.","journal-title":"ACM"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796811000189"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232420.1232424"},{"key":"e_1_3_2_1_11_1","volume-title":"PADL (Lecture Notes in Computer Science)","author":"Frost Richard A.","unstructured":"Richard A. Frost , Rahmatullah Hafiz , and Paul Callaghan . 2008. Parser Combinators for Ambiguous Left-Recursive Grammars . In PADL (Lecture Notes in Computer Science) , Paul Hudak and David Scott Warren (Eds.), Vol. 4902 . Springer , 167-181. Richard A. Frost, Rahmatullah Hafiz, and Paul Callaghan. 2008. Parser Combinators for Ambiguous Left-Recursive Grammars. In PADL (Lecture Notes in Computer Science), Paul Hudak and David Scott Warren (Eds.), Vol. 4902. Springer, 167-181."},{"key":"e_1_3_2_1_12_1","volume-title":"FLOPS (Lecture Notes in Computer Science), Yukiyoshi Kameyama and Peter J","author":"Gl\u00fcck Robert","unstructured":"Robert Gl\u00fcck and Masahiko Kawabe . 2004. Derivation of Deterministic Inverse Programs Based on LR Parsing . In FLOPS (Lecture Notes in Computer Science), Yukiyoshi Kameyama and Peter J . Stuckey (Eds.), Vol. 2998 . Springer , 291-306. Robert Gl\u00fcck and Masahiko Kawabe. 2004. Derivation of Deterministic Inverse Programs Based on LR Parsing. In FLOPS (Lecture Notes in Computer Science), Yukiyoshi Kameyama and Peter J. Stuckey (Eds.), Vol. 2998. Springer, 291-306."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071221.1071222"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169692"},{"key":"e_1_3_2_1_15_1","first-page":"376","article-title":"Automatic program inversion using symbolic transducers. In PLDI, Albert Cohen and Martin T. Vechev (Eds.)","author":"Hu Qinheping","year":"2017","unstructured":"Qinheping Hu and Loris D'Antoni . 2017 . Automatic program inversion using symbolic transducers. In PLDI, Albert Cohen and Martin T. Vechev (Eds.) . ACM , 376 - 389 . Qinheping Hu and Loris D'Antoni. 2017. Automatic program inversion using symbolic transducers. In PLDI, Albert Cohen and Martin T. Vechev (Eds.). ACM, 376-389.","journal-title":"ACM"},{"key":"e_1_3_2_1_16_1","volume-title":"Advanced Functional Programming (Lecture Notes in Computer Science)","author":"Hughes John","unstructured":"John Hughes . 1995. The Design of a Pretty-printing Library . In Advanced Functional Programming (Lecture Notes in Computer Science) , Johan Jeuring and Erik Meijer (Eds.), Vol. 925 . Springer , 53-96. John Hughes. 1995. The Design of a Pretty-printing Library. In Advanced Functional Programming (Lecture Notes in Computer Science), Johan Jeuring and Erik Meijer (Eds.), Vol. 925. Springer, 53-96."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000411"},{"key":"e_1_3_2_1_19_1","first-page":"57","article-title":"Generic conversions of abstract syntax representations. In WGP, Andres L\u00f6h and Ronald Garcia (Eds.)","author":"Keuchel Steven","year":"2012","unstructured":"Steven Keuchel and Johan Jeuring . 2012 . Generic conversions of abstract syntax representations. In WGP, Andres L\u00f6h and Ronald Garcia (Eds.) . ACM , 57 - 68 . Steven Keuchel and Johan Jeuring. 2012. Generic conversions of abstract syntax representations. In WGP, Andres L\u00f6h and Ronald Garcia (Eds.). ACM, 57-68.","journal-title":"ACM"},{"key":"e_1_3_2_1_20_1","first-page":"357","volume-title":"Atsushi Igarashi (Ed.)","volume":"10017","author":"Kiselyov Oleg","year":"2016","unstructured":"Oleg Kiselyov . 2016 . Probabilistic Programming Language and its Incremental Evaluation. In APLAS (Lecture Notes in Computer Science) , Atsushi Igarashi (Ed.) , Vol. 10017 . 357 - 376 . Oleg Kiselyov. 2016. Probabilistic Programming Language and its Incremental Evaluation. In APLAS (Lecture Notes in Computer Science), Atsushi Igarashi (Ed.), Vol. 10017. 357-376."},{"key":"e_1_3_2_1_21_1","first-page":"71","article-title":"A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. In PEPM, Ulrik Pagh Schultz and Jeremy Yallop (Eds.)","author":"Matsuda Kazutaka","year":"2017","unstructured":"Kazutaka Matsuda and Kazuyuki Asada . 2017 . A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. In PEPM, Ulrik Pagh Schultz and Jeremy Yallop (Eds.) . ACM , 71 - 82 . Kazutaka Matsuda and Kazuyuki Asada. 2017. A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. In PEPM, Ulrik Pagh Schultz and Jeremy Yallop (Eds.). ACM, 71-82.","journal-title":"ACM"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-013-9097-8"},{"key":"e_1_3_2_1_23_1","volume-title":"ESOP (Lecture Notes in Computer Science), Andrew D","author":"Matsuda Kazutaka","unstructured":"Kazutaka Matsuda , Shin-Cheng Mu , Zhenjiang Hu , and Masato Takeichi . 2010. A Grammar-Based Approach to Invertible Programs . In ESOP (Lecture Notes in Computer Science), Andrew D . Gordon (Ed.), Vol. 6012 . Springer , 448-467. Kazutaka Matsuda, Shin-Cheng Mu, Zhenjiang Hu, and Masato Takeichi. 2010. A Grammar-Based Approach to Invertible Programs. In ESOP (Lecture Notes in Computer Science), Andrew D. Gordon (Ed.), Vol. 6012. Springer, 448-467."},{"key":"e_1_3_2_1_24_1","volume-title":"ESOP (Lecture Notes in Computer Science)","author":"Matsuda Kazutaka","unstructured":"Kazutaka Matsuda and Meng Wang . 2013. FliPpr: A Prettier Invertible Printing System . In ESOP (Lecture Notes in Computer Science) , Matthias Felleisen and Philippa Gardner (Eds.), Vol. 7792 . Springer , 101-120. Kazutaka Matsuda and Meng Wang. 2013. FliPpr: A Prettier Invertible Printing System. In ESOP (Lecture Notes in Computer Science), Matthias Felleisen and Philippa Gardner (Eds.), Vol. 7792. Springer, 101-120."},{"key":"e_1_3_2_1_25_1","first-page":"62","article-title":"Applicative bidirectional programming with lenses. In ICFP, Kathleen Fisher and John H. Reppy (Eds.)","author":"Matsuda Kazutaka","year":"2015","unstructured":"Kazutaka Matsuda and Meng Wang . 2015 . Applicative bidirectional programming with lenses. In ICFP, Kathleen Fisher and John H. Reppy (Eds.) . ACM , 62 - 74 . Kazutaka Matsuda and Meng Wang. 2015. Applicative bidirectional programming with lenses. In ICFP, Kathleen Fisher and John H. Reppy (Eds.). ACM, 62-74.","journal-title":"ACM"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796818000096"},{"key":"e_1_3_2_1_27_1","volume-title":"ESOP (Lecture Notes in Computer Science)","author":"Matsuda Kazutaka","unstructured":"Kazutaka Matsuda and Meng Wang . 2018. HOBiT: Programming Lenses Without Using Lens Combinators . In ESOP (Lecture Notes in Computer Science) , Amal Ahmed (Ed.), Vol. 10801 . Springer , 31-59. Kazutaka Matsuda and Meng Wang. 2018. HOBiT: Programming Lenses Without Using Lens Combinators. In ESOP (Lecture Notes in Computer Science), Amal Ahmed (Ed.), Vol. 10801. Springer, 31-59."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the International Workshop on Rewriting in Proof and Computation. 188-198","author":"Nishida Naoki","year":"2001","unstructured":"Naoki Nishida , Masahiko Sakai , and Toshiki Sakabe . 2001 . Generation of inverse term rewriting systems for pure treeless functions . In Proceedings of the International Workshop on Rewriting in Proof and Computation. 188-198 . Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. 2001. Generation of inverse term rewriting systems for pure treeless functions. In Proceedings of the International Workshop on Rewriting in Proof and Computation. 188-198."},{"key":"e_1_3_2_1_30_1","volume-title":"MPC (Lecture Notes in Computer Science), Claude Bolduc, Jules Desharnais, and B\u00e9chir Ktari (Eds.)","author":"Pacheco Hugo","unstructured":"Hugo Pacheco and Alcino Cunha . 2010. Generic Point-free Lenses . In MPC (Lecture Notes in Computer Science), Claude Bolduc, Jules Desharnais, and B\u00e9chir Ktari (Eds.) , Vol. 6120 . Springer , 331-352. Hugo Pacheco and Alcino Cunha. 2010. Generic Point-free Lenses. In MPC (Lecture Notes in Computer Science), Claude Bolduc, Jules Desharnais, and B\u00e9chir Ktari (Eds.), Vol. 6120. Springer, 331-352."},{"key":"e_1_3_2_1_31_1","first-page":"39","article-title":"Monadic combinators for \"Putback\" style bidirectional programming. In PEPM, Wei-Ngan Chin and Jurriaan Hage (Eds.)","author":"Pacheco Hugo","year":"2014","unstructured":"Hugo Pacheco , Zhenjiang Hu , and Sebastian Fischer . 2014 . Monadic combinators for \"Putback\" style bidirectional programming. In PEPM, Wei-Ngan Chin and Jurriaan Hage (Eds.) . ACM , 39 - 50 . Hugo Pacheco, Zhenjiang Hu, and Sebastian Fischer. 2014. Monadic combinators for \"Putback\" style bidirectional programming. In PEPM, Wei-Ngan Chin and Jurriaan Hage (Eds.). ACM, 39-50.","journal-title":"ACM"},{"key":"e_1_3_2_1_32_1","first-page":"229","article-title":"A New Notation for Arrows. In ICFP, Benjamin C. Pierce (Ed.)","author":"Paterson Ross","year":"2001","unstructured":"Ross Paterson . 2001 . A New Notation for Arrows. In ICFP, Benjamin C. Pierce (Ed.) . ACM , 229 - 240 . Ross Paterson. 2001. A New Notation for Arrows. In ICFP, Benjamin C. Pierce (Ed.). ACM, 229-240.","journal-title":"ACM"},{"key":"e_1_3_2_1_33_1","first-page":"177","article-title":"Embedding a full linear Lambda calculus in Haskell. In Haskell, Ben Lippmeier (Ed.)","author":"Polakow Jeff","year":"2015","unstructured":"Jeff Polakow . 2015 . Embedding a full linear Lambda calculus in Haskell. In Haskell, Ben Lippmeier (Ed.) . ACM , 177 - 188 . Jeff Polakow. 2015. Embedding a full linear Lambda calculus in Haskell. In Haskell, Ben Lippmeier (Ed.). ACM, 177-188.","journal-title":"ACM"},{"key":"e_1_3_2_1_34_1","first-page":"1","article-title":"Invertible syntax descriptions: unifying parsing and pretty printing. In Haskell, Jeremy Gibbons (Ed.)","author":"Rendel Tillmann","year":"2010","unstructured":"Tillmann Rendel and Klaus Ostermann . 2010 . Invertible syntax descriptions: unifying parsing and pretty printing. In Haskell, Jeremy Gibbons (Ed.) . ACM , 1 - 12 . Tillmann Rendel and Klaus Ostermann. 2010. Invertible syntax descriptions: unifying parsing and pretty printing. In Haskell, Jeremy Gibbons (Ed.). ACM, 1-12.","journal-title":"ACM"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"e_1_3_2_1_36_1","volume-title":"The Fun of Programming, Jeremy Gibbons and Oege de Moor (Eds.)","author":"Wadler Philip","unstructured":"Philip Wadler . 2003. A Prettier Printer . In The Fun of Programming, Jeremy Gibbons and Oege de Moor (Eds.) . Palgrave Macmillan , Chapter 11. Philip Wadler. 2003. A Prettier Printer. In The Fun of Programming, Jeremy Gibbons and Oege de Moor (Eds.). Palgrave Macmillan, Chapter 11."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.02.007"},{"key":"e_1_3_2_1_38_1","volume-title":"Holger Bock Axelsen, and Robert Gl\u00fcck","author":"Yokoyama Tetsuo","year":"2011","unstructured":"Tetsuo Yokoyama , Holger Bock Axelsen, and Robert Gl\u00fcck . 2011 . Towards a Reversible Functional Language. In RC (Lecture Notes in Computer Science), Alexis De Vos and Robert Wille (Eds.), Vol. 7165 . Springer , 14-29. Tetsuo Yokoyama, Holger Bock Axelsen, and Robert Gl\u00fcck. 2011. Towards a Reversible Functional Language. In RC (Lecture Notes in Computer Science), Alexis De Vos and Robert Wille (Eds.), Vol. 7165. Springer, 14-29."}],"event":{"name":"ICFP '18: 23nd ACM SIGPLAN International Conference on Functional Programming","location":"St. Louis MO USA","acronym":"ICFP '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3242744.3242758","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3242744.3242758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:57:22Z","timestamp":1750193842000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3242744.3242758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,17]]},"references-count":38,"alternative-id":["10.1145\/3242744.3242758","10.1145\/3242744"],"URL":"https:\/\/doi.org\/10.1145\/3242744.3242758","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3299711.3242758","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,9,17]]},"assertion":[{"value":"2018-09-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}