{"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":1775868625472,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370359","type":"print"},{"value":"9783642370366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_6","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:55Z","timestamp":1361198155000},"page":"101-120","source":"Crossref","is-referenced-by-count":14,"title":["FliPpr: A Prettier Invertible Printing System"],"prefix":"10.1007","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"B.S. Baker","year":"1979","unstructured":"Baker, B.S.: Composition of Top-down and Bottom-up Tree Transductions. Information and Control\u00a041(2), 186\u2013213 (1979)","journal-title":"Information and Control"},{"key":"6_CR2","unstructured":"Boulton, R.J.: Syn: A Single Language for Specifiying Abstract Syntax Tress, Lexical Analysis, Parsing and Pretty-Printing. Technical Report UCAM-CL-TR-390, University of Cambridge Computer Laboratory (1996)"},{"issue":"4-5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.is.2008.01.006","volume":"33","author":"C. Brabrand","year":"2008","unstructured":"Brabrand, C., M\u00f8ller, A., Schwartzbach, M.I.: Dual Syntax for XML Languages. Inf. Syst.\u00a033(4-5), 385\u2013406 (2008)","journal-title":"Inf. Syst."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Dureg\u00e5rd, J., Jansson, P.: Embedded Parser Generators. In: Haskell 2011: Proceedings of the 2011 ACM SIGPLAN Haskell Symposium, pp. 107\u2013117. ACM (2011)","DOI":"10.1145\/2096148.2034689"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dureg\u00e5rd, J., Jansson, P., Wang, M.: Feat: Functional Enumeration of Algebraic Types. In: Haskell 2012: Proceedings of the 2012 ACM SIGPLAN Haskell Symposium, pp. 61\u201372. ACM (2012)","DOI":"10.1145\/2364506.2364515"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Greenwald, M.B., Moore, J.T., Pierce, B.C., Schmitt, A.: Combinators for Bidirectional Tree Transformations: A Linguistic Approach to the View-Update Problem. ACM Trans. Program. Lang. Syst. 29(3) (2007)","DOI":"10.1145\/1232420.1232424"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Pilkiewicz, A., Pierce, B.C.: Quotient Lenses. In: ICFP 2008: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, pp. 383\u2013396. ACM (2008)","DOI":"10.1145\/1411204.1411257"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-77442-6_12","volume-title":"Practical Aspects of Declarative Languages","author":"R.A. Frost","year":"2008","unstructured":"Frost, R.A., Hafiz, R., Callaghan, P.: Parser Combinators for Ambiguous Left-Recursive Grammars. In: Hudak, P., Warren, D.S. (eds.) PADL 2008. LNCS, vol.\u00a04902, pp. 167\u2013181. Springer, Heidelberg (2008)"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72248-6","volume-title":"Syntax-Directed Semantics: Formal Models Based on Tree Transducers","author":"Z. F\u00fcl\u00f6p","year":"1998","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Syntax-Directed Semantics: Formal Models Based on Tree Transducers, 1st edn. Springer-Verlag New York, Inc., Secaucus (1998)","edition":"1"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-59451-5_3","volume-title":"Advanced Functional Programming","author":"J. Hughes","year":"1995","unstructured":"Hughes, J.: The Design of a Pretty-Printing Library. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 53\u201396. Springer, Heidelberg (1995)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6423(01)00020-X","volume":"43","author":"P. Jansson","year":"2002","unstructured":"Jansson, P., Jeuring, J.: Polytypic Data Conversion Programs. Sci. Comput. Program.\u00a043(1), 35\u201375 (2002)","journal-title":"Sci. Comput. Program."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Jonsson, P.A., Nordlander, J.: Positive Supercompilation for a Higher Order Call-by-Value Language. In: POPL 2009: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 277\u2013288. ACM (2009)","DOI":"10.1145\/1594834.1480916"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Tabuchi, N., Unno, H.: Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification. In: POPL 2010: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 495\u2013508. ACM (2010)","DOI":"10.1145\/1706299.1706355"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45127-7_13","volume-title":"Rewriting Techniques and Applications","author":"A. K\u00fchnemann","year":"2001","unstructured":"K\u00fchnemann, A., Gl\u00fcck, R., Kakehi, K.: Relating Accumulative and Non-accumulative Functional Programs. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 154\u2013168. Springer, Heidelberg (2001)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-11957-6_24","volume-title":"Programming Languages and Systems","author":"K. Matsuda","year":"2010","unstructured":"Matsuda, K., Mu, S.-C., Hu, Z., Takeichi, M.: A Grammar-Based Approach to Invertible Programs. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 448\u2013467. Springer, Heidelberg (2010)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with Derivatives: A Functional Pearl. In: ICFP 2011: Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, pp. 189\u2013195. ACM (2011)","DOI":"10.1145\/2034773.2034801"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Rendel, T., Ostermann, K.: Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing. In: Haskell 2010: Proceedings of the 2010 ACM SIGPLAN Haskell Symposium, pp. 1\u201312. ACM (2010)","DOI":"10.1145\/2088456.1863525"},{"issue":"1&2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(96)00074-6","volume":"167","author":"D. Sands","year":"1996","unstructured":"Sands, D.: Proving the Correctness of Recursion-Based Automatic Program Transformations. Theor. Comput. Sci.\u00a0167(1&2), 193\u2013233 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1093\/comjnl\/35.5.514","volume":"35","author":"H. S\u00f8ndergaard","year":"1992","unstructured":"S\u00f8ndergaard, H., Sestoft, P.: Non-Determinism in Functional Languages. Comput. J.\u00a035(5), 514\u2013523 (1992)","journal-title":"Comput. J."},{"issue":"6","key":"6_CR20","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M.H. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A Positive Supercompiler. J. Funct. Program.\u00a06(6), 811\u2013838 (1996)","journal-title":"J. Funct. Program."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: Transforming Programs to Eliminate Trees. Theor. Comput. Sci.\u00a073(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Wadler, P.: A Prettier Printer. In: Gibbons, J., de Moor, O. (eds.) The Fun of Programming. Palgrave Macmillan (2003)","DOI":"10.1007\/978-1-349-91518-7_11"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T17:08:56Z","timestamp":1562692136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}