{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:17:42Z","timestamp":1726031862090},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214999"},{"type":"electronic","value":"9783030215002"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21500-2_5","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"67-83","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterizing Compatible View Updates in Syntactic Bidirectionalization"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Nishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"issue":"2\u20133","key":"5_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6423(02)00023-0","volume":"43","author":"SM Abramov","year":"2002","unstructured":"Abramov, S.M., Gl\u00fcck, R.: The universal resolving algorithm and its correctness: inverse computation in a functional language. Sci. Comput. Program. 43(2\u20133), 193\u2013229 (2002)","journal-title":"Sci. Comput. Program."},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/319628.319634","volume":"6","author":"F Bancilhon","year":"1981","unstructured":"Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557\u2013575 (1981)","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Barbosa, D.M., Cretin, J., Foster, N., Greenberg, M., Pierce, B.C.: Matching lenses: alignment and view update. In: Hudak, P., Weirich, S. (eds.) Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010), pp. 193\u2013204. ACM (2010)","DOI":"10.1145\/1863543.1863572"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"JA Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Conditional rewrite rules: confluence and termination. J. Comput. Syst. Sci. 32, 323\u2013362 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-60381-6_4","volume-title":"Conditional and Typed Rewriting Systems","author":"A Bockmayr","year":"1995","unstructured":"Bockmayr, A., Werner, A.: LSE narrowing for decreasing conditional term rewrite systems. In: Dershowitz, N., Lindenstrauss, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 51\u201370. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-60381-6_4"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chin, W.N.: Towards an automated tupling strategy. In: Proceedings of Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, June 1993, pp. 119\u2013132. ACM, New York (1993)","DOI":"10.1145\/154630.154643"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"issue":"6","key":"5_CR9","first-page":"1","volume":"10","author":"Z Diskin","year":"2011","unstructured":"Diskin, Z., Xiong, Y., Czarnecki, K.: From state- to delta-based bidirectional model transformations: the asymmetric case. J. Object Technol. 10(6), 1\u201325 (2011)","journal-title":"J. Object Technol."},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-015-5316-8","volume":"58","author":"S Fischer","year":"2015","unstructured":"Fischer, S., Hu, Z., Pacheco, H.: The essence of bidirectional programming. Sci. China Inf. Sci. 58(5), 1\u201321 (2015)","journal-title":"Sci. China Inf. Sci."},{"issue":"3","key":"5_CR11","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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32202-0_1","volume-title":"Generic and Indexed Programming","author":"N Foster","year":"2012","unstructured":"Foster, N., Matsuda, K., Voigtl\u00e4nder, J.: Three complementary approaches to bidirectional programming. In: Gibbons, J. (ed.) Generic and Indexed Programming. LNCS, vol. 7470, pp. 1\u201346. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32202-0_1"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(90)90105-Q","volume":"89","author":"H Ganzinger","year":"1991","unstructured":"Ganzinger, H.: Order-sorted completion: the many-sorted way. Theor. Comput. Sci. 89(1), 3\u201332 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR14","first-page":"367","volume":"66","author":"R Gl\u00fcck","year":"2005","unstructured":"Gl\u00fcck, R., Kawabe, M.: A method for automatic program inversion based on LR(0) parsing. Fundam. Inform. 66(4), 367\u2013395 (2005)","journal-title":"Fundam. Inform."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-40018-9_17","volume-title":"Programming Languages and Systems","author":"R Gl\u00fcck","year":"2003","unstructured":"Gl\u00fcck, R., Kawabe, M.: A program inverter for a functional language with equality and constructors. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 246\u2013264. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-40018-9_17"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Hidaka, S., Hu, Z., Inaba, K., Kato, H., Matsuda, K., Nakano, K.: Bidirectionalizing graph transformations. In: Hudak, P., Weirich, S. (eds.) Proceedings of the 15th ACM SIGPLAN International Conference on Functional programming (ICFP 2010), pp. 205\u2013216. ACM (2010)","DOI":"10.1145\/1863543.1863573"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 364\u2013379. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71070-7_32"},{"key":"5_CR18","unstructured":"Hu, Z., Sch\u00fcrr, A., Stevens, P., Terwilliger, J.F.: Bidirectional transformation \u201cbx\u201d (Dagstuhl Seminar 11031). In: Dagstuhl Reports, vol. 1, no. 1, pp. 42\u201367 (2011). \n                      http:\/\/drops.dagstuhl.de\/volltexte\/2011\/3144\/"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction","author":"J-M Hullot","year":"1980","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Bibel, W., Kowalski, R. (eds.) CADE 1980. LNCS, vol. 87, pp. 318\u2013334. Springer, Heidelberg (1980). \n                      https:\/\/doi.org\/10.1007\/3-540-10009-1_25"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987). \n                      https:\/\/doi.org\/10.1007\/978-3-642-83189-8","edition":"2"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Hu, Z., Nakano, K., Hamana, M., Takeichi, M.: Bidirectionalization transformation based on automatic derivation of view complement functions. In: Hinze, R., Ramsey, N. (eds.) Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, pp. 47\u201358. ACM (2007)","DOI":"10.1145\/1291151.1291162"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2012.09.005","volume":"464","author":"M Nagashima","year":"2012","unstructured":"Nagashima, M., Sakai, M., Sakabe, T.: Determinization of conditional term rewriting systems. Theor. Comput. Sci. 464, 72\u201389 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jlamp.2017.10.003","volume":"94","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Palacios, A., Vidal, G.: Reversible computation in term rewriting. J. Log. Algebr. Methods Program. 94, 128\u2013149 (2018)","journal-title":"J. Log. Algebr. Methods Program."},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00200-010-0122-4","volume":"21","author":"N Nishida","year":"2010","unstructured":"Nishida, N., Vidal, G.: Termination of narrowing via termination of rewriting. Appl. Algebra Eng. Commun. Comput. 21(3), 177\u2013225 (2010)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"5_CR26","unstructured":"Nishida, N., Vidal, G.: Characterizing compatible view updates in syntactic bidirectionalization. Technical report, DSIC, UPV (2019). \n                      http:\/\/personales.upv.es\/gvidal\/german\/rc19\/tr.pdf"},{"issue":"1\u20132","key":"5_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"IC Phillips","year":"2007","unstructured":"Phillips, I.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007)","journal-title":"J. Log. Algebr. Program."},{"issue":"3","key":"5_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"WC Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory 4(3), 257\u2013287 (1970)","journal-title":"Math. Syst. Theory"},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"JR Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. J. ACM 21(4), 622\u2013642 (1974)","journal-title":"J. ACM"},{"key":"5_CR30","unstructured":"Terese: Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Voigtl\u00e4nder, J.: Bidirectionalization for free! (pearl). In: Shao, Z., Pierce, B.C. (eds.) Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2009), pp. 165\u2013176. ACM (2009)","DOI":"10.1145\/1480881.1480904"},{"key":"5_CR32","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, 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Axelsen, H., Gl\u00fcck, R.: Principles of a reversible programming language. In: Ram\u00edrez, A., Bilardi, G., Gschwind, M. (eds.) Proceedings of the 5th Conference on Computing Frontiers, pp. 43\u201354. ACM (2008)","DOI":"10.1145\/1366230.1366239"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21500-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:15:04Z","timestamp":1560726904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21500-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214999","9783030215002"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21500-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lausanne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One invited paper is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}