{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:14:41Z","timestamp":1767982481175,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["24700020"],"award-info":[{"award-number":["24700020"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K15966"],"award-info":[{"award-number":["15K15966"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15H02681"],"award-info":[{"award-number":["15H02681"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004721","name":"University of Tokyo","doi-asserted-by":"crossref","award":["Study Program at the Overseas Universities"],"award-info":[{"award-number":["Study Program at the Overseas Universities"]}],"id":[{"id":"10.13039\/501100004721","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00354-018-0033-7","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T05:24:28Z","timestamp":1535347468000},"page":"173-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["FliPpr: A System for Deriving Parsers from Pretty-Printers"],"prefix":"10.1007","volume":"36","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Abramov, S.M., Gl\u00fcck, R., Klimov, Y.A.: An universal resolving algorithm for inverse computation of lazy languages. In: Virbitskaite, I., Voronkov, A., (eds.) Ershov Memorial Conference, Lecture Notes in Computer Science, vol. 4378, pp. 27\u201340. Springer (2006)","DOI":"10.1007\/978-3-540-70881-0_6"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Adams, M.D.: Principled parsing for indentation-sensitive languages: revisiting landin\u2019s offside rule. In: Giacobazzi, R., Cousot, R., (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201913, Rome, January 23\u201325, pp. 511\u2013522. ACM (2013)","DOI":"10.1145\/2429069.2429129"},{"key":"33_CR3","volume-title":"The theory of parsing, translation, and compiling","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Prentice-Hall Inc, Upper Saddle River (1972)"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 47(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"BS Baker","year":"1979","unstructured":"Baker, B.S.: Composition of top-down and bottom-up tree transductions. Inf. Control 41(2), 186\u2013213 (1979)","journal-title":"Inf. Control"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Bernardy, J.: A pretty but not greedy printer (functional pearl). PACMPL 1(ICFP), 6:1\u20136:21 (2017)","DOI":"10.1145\/3110250"},{"key":"33_CR7","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\u20135","key":"33_CR8","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. 33(4\u20135), 385\u2013406 (2008)","journal-title":"Inf. Syst."},{"key":"33_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"33_CR10","first-page":"1","volume-title":"Workshop on Dependently-typed programming, DTP","author":"NA Danielsson","year":"2013","unstructured":"Danielsson, N.A.: Correct-by-construction pretty-printing. In: Weirich, S. (ed.) Workshop on Dependently-typed programming, DTP, pp. 1\u201312. ACM, New York (2013)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Dureg\u00e5rd, J., Jansson, P.: Embedded parser generators. In: Proceedings of the 4th ACM symposium on Haskell. Haskell \u201911, pp. 107\u2013117. ACM, New York (2011)","DOI":"10.1145\/2034675.2034689"},{"key":"33_CR12","series-title":"Haskell \u201912","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/2364506.2364515","volume-title":"Haskell symposium","author":"J Dureg\u00e5rd","year":"2012","unstructured":"Dureg\u00e5rd, J., Jansson, P., Wang, M.: Feat: functional enumeration of algebraic types. Haskell symposium. Haskell \u201912, pp. 61\u201372. ACM, New York (2012)"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71\u2013146 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1232420.1232424","volume":"29","author":"JN Foster","year":"2007","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), 17 (2007)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Pilkiewicz, A., Pierce, B.C.: Quotient lenses. In: Hook, J., Thiemann, P. (eds.) ICFP, pp. 383\u2013396. ACM (2008)","DOI":"10.1145\/1411203.1411257"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Frost, R.A., Hafiz, R., Callaghan, P.: Parser combinators for ambiguous left-recursive grammars. In: Hudak, P., Warren, D.S. (eds.) PADL, Lecture Notes in Computer Science, vol. 4902, pp. 167\u2013181. Springer (2008)","DOI":"10.1007\/978-3-540-77442-6_12"},{"key":"33_CR17","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. New York Inc., Secaucus, Springer-Verlag (1998)","edition":"1"},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF03037260","volume":"20","author":"Y Futamura","year":"2002","unstructured":"Futamura, Y., Konishi, Z., Gl\u00fcck, R.: Program transformation system based on generalized partial computation. New Gener. Comput. 20(1), 75\u2013100 (2002)","journal-title":"New Gener. Comput."},{"issue":"1","key":"33_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(91)90299-H","volume":"90","author":"Y Futamura","year":"1991","unstructured":"Futamura, Y., Nogi, K., Takano, A.: Essence of generalized partial computation. Theor. Comput. Sci. 90(1), 61\u201379 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kawabe, M.: Derivation of deterministic inverse programs based on LR parsing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS, Lecture Notes in Computer Science, vol. 2998, pp. 291\u2013306. Springer (2004)","DOI":"10.1007\/978-3-540-24754-8_21"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"CK Gomard","year":"1991","unstructured":"Gomard, C.K., Jones, N.D.: A partial evaluator for the untyped lambda-calculus. J. Funct. Program. 1(1), 21\u201369 (1991)","journal-title":"J. Funct. Program."},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Functional logic programming: From theory to curry. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics\u2014Essays in Memory of Harald Ganzinger, Lecture Notes in Computer Science, vol. 7797, pp. 123\u2013168. Springer (2013)","DOI":"10.1007\/978-3-642-37651-1_6"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Hu, Q., D\u2019Antoni, L.: Automatic program inversion using symbolic transducers. In: Cohen, A., Vechev, M.T. (eds.) Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, June 18\u201323, pp. 376\u2013389. ACM (2017)","DOI":"10.1145\/3062341.3062345"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Hughes, J.: The design of a pretty-printing library. In: Jeuring, J., Meijer, E. (eds.) Advanced Functional Programming, Lecture Notes in Computer Science, vol. 925, pp. 53\u201396. Springer (1995)","DOI":"10.1007\/3-540-59451-5_3"},{"issue":"1","key":"33_CR25","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. 43(1), 35\u201375 (2002)","journal-title":"Sci. Comput. Program."},{"key":"33_CR26","volume-title":"Partial evaluation and automatic program generation","author":"ND Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial evaluation and automatic program generation. Prentice Hall international series in computer science. Prentice Hall, Upper Saddle River (1993)"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Jonsson, P.A., Nordlander, J.: Positive supercompilation for a higher order call-by-value language. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 277\u2013288. ACM (2009)","DOI":"10.1145\/1594834.1480916"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., Peyton Jones, S.L., Sabry, A.: Lazy v. yield: Incremental, linear pretty-printing. In: Jhala, R., Igarashi, A. (eds.) Programming Languages and Systems\u201410th Asian Symposium, APLAS, Lecture Notes in Computer Science, vol. 7705, pp. 190\u2013206. Springer (2012)","DOI":"10.1007\/978-3-642-35182-2_14"},{"issue":"2","key":"33_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: Semantics of context-free languages. Mathematical Systems Theory 2(2), 127\u2013145 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Ko, H., Zan, T., Hu, Z.: BiGUL: a formally verified core language for putback-based bidirectional programming. In: Erwig, M., Rompf, T. (eds.) Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2016, St. Petersburg, January 20\u201322, pp. 61\u201372. ACM (2016)","DOI":"10.1145\/2847538.2847544"},{"key":"33_CR31","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Tabuchi, N., Unno, H.: Higher-order multi-parameter tree transducers and recursion schemes for program verification. In: Hermenegildo, M.V., Palsberg, J. (eds.) POPL, pp. 495\u2013508. ACM (2010)","DOI":"10.1145\/1707801.1706355"},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"K\u00fchnemann, A., Gl\u00fcck, R., Kakehi, K.: Relating accumulative and non-accumulative functional programs. In: Middeldorp, A. (ed.) RTA. Lecture Notes in Computer Science, vol. 2051, pp. 154\u2013168. Springer (2001)","DOI":"10.1007\/3-540-45127-7_13"},{"key":"33_CR33","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Inaba, K., Nakano, K.: Polynomial-time inverse computation for accumulative functions with multiple data traversals. In: Kiselyov, O., Thompson, S. (eds.) PEPM, pp. 5\u201314. ACM (2012)","DOI":"10.1145\/2103746.2103752"},{"issue":"1","key":"33_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10990-013-9097-8","volume":"25","author":"K Matsuda","year":"2012","unstructured":"Matsuda, K., Inaba, K., Nakano, K.: Polynomial-time inverse computation for accumulative functions with multiple data traversals. High. Order Symb. Comput. 25(1), 3\u201338 (2012)","journal-title":"High. Order Symb. Comput."},{"key":"33_CR35","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Mu, S.C., Hu, Z., Takeichi, M.: A grammar-based approach to invertible programs. In: Gordon, A.D. (ed.) ESOP, Lecture Notes in Computer Science, vol. 6012, pp. 448\u2013467. Springer (2010)","DOI":"10.1007\/978-3-642-11957-6_24"},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Wang, M.: FliPpr: a prettier invertible printing system. In: Felleisen, M., Gardner, P. (eds.) ESOP, Lecture Notes in Computer Science, vol. 7792, pp. 101\u2013120. Springer (2013)","DOI":"10.1007\/978-3-642-37036-6_6"},{"key":"33_CR37","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Wang, M.: HOBiT: Programming lenses without using lens combinators. In: Ahmed, A. (ed.) Programming Languages and Systems\u201427th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, April 14\u201320, Proceedings, Lecture Notes in Computer Science, vol. 10801, pp. 31\u201359. Springer (2018)","DOI":"10.1007\/978-3-319-89884-1_2"},{"key":"33_CR38","doi-asserted-by":"crossref","unstructured":"McPeak, S., Necula, G.C.: Elkhound: a fast, practical GLR parser generator. In: Duesterwald, E. (ed.) Compiler Construction, 13th International Conference, CC 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, March 29\u2013April 2, Proceedings, Lecture Notes in Computer Science, vol. 2985, pp. 73\u201388. Springer (2004)","DOI":"10.1007\/978-3-540-24723-4_6"},{"key":"33_CR39","doi-asserted-by":"crossref","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with derivatives: a functional pearl. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, September 19\u201321, pp. 189\u2013195. ACM (2011)","DOI":"10.1145\/2034574.2034801"},{"key":"33_CR40","doi-asserted-by":"crossref","unstructured":"Pombrio, J., Krishnamurthi, S.: Resugaring: lifting evaluation sequences through syntactic sugar. In O\u2019Boyle, M.F.P., Pingali, K. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201914, Edinburgh, June 09\u201311, pp. 361\u2013371. ACM (2014)","DOI":"10.1145\/2666356.2594319"},{"key":"33_CR41","doi-asserted-by":"crossref","unstructured":"Rendel, T., Ostermann, K.: Invertible syntax descriptions: unifying parsing and pretty printing. In: Gibbons, J. (ed.) Haskell, pp. 1\u201312. ACM (2010)","DOI":"10.1145\/2088456.1863525"},{"issue":"1&2","key":"33_CR42","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. 167(1&2), 193\u2013233 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"33_CR43","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.entcs.2010.08.041","volume":"253","author":"E Scott","year":"2010","unstructured":"Scott, E., Johnstone, A.: GLL parsing. Electron. Notes Theor. Comput. Sci. 253(7), 177\u2013189 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"33_CR44","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"33_CR45","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. 35(5), 514\u2013523 (1992)","journal-title":"Comput. J."},{"key":"33_CR46","doi-asserted-by":"crossref","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In: Sannella, D. (ed.) Programming Languages and Systems\u2014ESOP\u201994, 5th European Symposium on Programming, Edinburgh, April 11\u201313, Proceedings, Lecture Notes in Computer Science, vol. 788, pp. 485\u2013500. Springer (1994)","DOI":"10.1007\/3-540-57880-3_32"},{"issue":"6","key":"33_CR47","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"MH S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A positive supercompiler. J. Funct. Program. 6(6), 811\u2013838 (1996)","journal-title":"J. Funct. Program."},{"issue":"1","key":"33_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796808006990","volume":"19","author":"SD Swierstra","year":"2009","unstructured":"Swierstra, S.D., Chitil, O.: Linear, bounded, functional pretty-printing. J. Funct. Program. 19(1), 1\u201316 (2009)","journal-title":"J. Funct. Program."},{"key":"33_CR49","unstructured":"Tomita, M.: An efficient context-free parsing algorithm for natural languages. In: Joshi, A.K. (ed.) Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, August 1985, pp. 756\u2013764. Morgan Kaufmann (1985)"},{"key":"33_CR50","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Sidner, C.L. (ed.) 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Stanford, July 6-9, pp. 104\u2013111. ACL (1987)","DOI":"10.3115\/981175.981190"},{"issue":"2","key":"33_CR51","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. 73(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR52","doi-asserted-by":"crossref","unstructured":"Wadler, P.: A prettier printer. In: Gibbons, J., de\u00a0Moor, O. (eds.) The Fun of Programming. Palgrave Macmillan (2003)","DOI":"10.1007\/978-1-349-91518-7_11"},{"key":"33_CR53","doi-asserted-by":"crossref","unstructured":"Yellin, D.M.: Attribute Grammar Inversion and Source-to-source Translation, Lecture Notes in Computer Science, vol. 302. Springer (1988)","DOI":"10.1007\/3-540-19072-4"},{"key":"33_CR54","doi-asserted-by":"crossref","unstructured":"Zaytsev, V., Bagge, A.H.: Parsing in a broad sense. In: Dingel, J., Schulte, W., Ramos, I., Abrah\u00e3o, S., Insfr\u00e1n, E. (eds.) Model-Driven Engineering Languages and Systems\u201417th International Conference, MODELS 2014, Valencia, September 28\u2013October 3. Proceedings, Lecture Notes in Computer Science, vol. 8767, pp. 50\u201367. Springer (2014)","DOI":"10.1007\/978-3-319-11653-2_4"},{"key":"33_CR55","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Zhang, Y., Ko, H., Martins, P., Saraiva, J., Hu, Z.: Parsing and reflective printing, bidirectionally. In: van\u00a0der Storm, T., Balland, E., Varr\u00f3, D. (eds.) Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering, Amsterdam, October 31\u2013November 1, pp. 2\u201314. ACM (2016)","DOI":"10.1145\/2997364.2997369"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-018-0033-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-018-0033-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-018-0033-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T05:23:57Z","timestamp":1589693037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-018-0033-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s00354-018-0033-7","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"28 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}