{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:48:34Z","timestamp":1784206114663,"version":"3.55.0"},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7274","type":"journal-article","created":{"date-parts":[[2017,4,30]],"date-time":"2017-04-30T22:14:37Z","timestamp":1493590477000},"page":"1026-1034","source":"Crossref","is-referenced-by-count":19,"title":["A Minimalist's Reversible While Language"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Robert","family":"GL\u00dcCK","sequence":"first","affiliation":[{"name":"DIKU, Dept. of Computer Science, University of Copenhagen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tetsuo","family":"YOKOYAMA","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, Nanzan University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] A. De Vos, Reversible Computing: Fundamentals, Quantum Computing, and Applications, Wiley-VCH, 2010.","DOI":"10.1002\/9783527633999"},{"key":"2","unstructured":"[2] R. Gl\u00fcck and T. Yokoyama, eds., Reversible Computation, LNCS, vol.7581, Springer-Verlag, 2013."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] R. Wille and R. Drechsler, Towards a Design Flow for Reversible Logic, Springer-Verlag, 2010.","DOI":"10.1007\/978-90-481-9579-4"},{"key":"4","unstructured":"[4] N.D. Jones, Computability and Complexity: From a Programming Perspective, MIT Press, 1997. Revised version, available from http:\/\/www.diku.dk\/neil\/Comp2book.html"},{"key":"5","unstructured":"[5] R. Gl\u00fcck and T. Yokoyama, \u201cA linear-time self-interpreter of a reversible imperative language,\u201d Computer Software, vol.33, no.3, pp.108-128, 2016."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] H.B. Axelsen and R. Gl\u00fcck, \u201cWhat do reversible programs compute?,\u201d FoSSaCS, ed. M. Hofmann, LNCS, vol.6604, pp.42-56, Springer-Verlag, 2011.","DOI":"10.1007\/978-3-642-19805-2_4"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Yokoyama, H.B. Axelsen, and R. Gl\u00fcck, \u201cReversible flowchart languages and the structured reversible program theorem,\u201d ICALP, eds. L. Aceto, et al., LNCS, vol.5126, pp.258-270, Springer-Verlag, 2008.","DOI":"10.1007\/978-3-540-70583-3_22"},{"key":"8","unstructured":"[8] K. Morita, A. Shirasaki, and Y. Gono, \u201cA 1-tape 2-symbol reversible Turing machine,\u201d IEICE Trans., vol.E72, no.3, pp.223-228, 1989."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] K. Morita, \u201cUniversal reversible Turing machines with a small number of tape symbols,\u201d Fundamenta Informaticae, vol.138, no.1-2, pp.17-29, 2015.","DOI":"10.3233\/FI-2015-1195"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] G. Winskel, The Formal Semantics of Programming Languages: An Introduction, MIT Press, 1993.","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H.B. Axelsen, R. Gl\u00fcck, and T. Yokoyama, \u201cReversible machine code and its abstract processor architecture,\u201d CSR, eds. V. Diekert, et al., LNCS, vol.4649, pp.56-69, Springer-Verlag, 2007.","DOI":"10.1007\/978-3-540-74510-5_9"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Gl\u00fcck and M. Kawabe, \u201cA program inverter for a functional language with equality and constructors,\u201d APLAS, ed. A. Ohori, LNCS, vol.2895, pp.246-264, Springer-Verlag, 2003.","DOI":"10.1007\/978-3-540-40018-9_17"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R. Gl\u00fcck and M. Kawabe, \u201cDerivation of deterministic inverse programs based on LR parsing,\u201d FLOPS, eds. Y. Kameyama and P.J. Stuckey, LNCS, vol.2998, pp.291-306, Springer-Verlag, 2004.","DOI":"10.1007\/978-3-540-24754-8_21"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] K.E. Grue, \u201cArrays in pure functional programming languages,\u201d LISP and Symbolic Computation, vol.2, no.2, pp.105-113, 1989.","DOI":"10.1007\/BF01811535"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7274\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T16:45:30Z","timestamp":1602002730000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7274\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7274","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}