{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T02:40:31Z","timestamp":1692240031547},"reference-count":7,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edl8141","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T22:10:58Z","timestamp":1456783858000},"page":"751-755","source":"Crossref","is-referenced-by-count":0,"title":["Bounded-Choice Statements for User Interaction in Imperative Programming"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Keehang","family":"KWON","sequence":"first","affiliation":[{"name":"Dept. of Computer Eng., Dong-A University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeongyoon","family":"SEO","sequence":"additional","affiliation":[{"name":"Dept. of Computer Eng., Dong-A University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daeseong","family":"KANG","sequence":"additional","affiliation":[{"name":"Dept. of Electronics Eng., Dong-A University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] G. Kahn, \u201cNatural semantics,\u201d Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science, LNCS, vol.247, 1987."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] G. Japaridze, \u201cIntroduction to computability logic,\u201d Annals of Pure and Applied Logic, vol.123, no.1-3, pp.1-99, 2003.","DOI":"10.1016\/S0168-0072(03)00023-X"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] G. Japaridze, \u201cSequential operators in computability logic,\u201d Information and Computation, vol.206, no.12, pp.1443-1475, 2008.","DOI":"10.1016\/j.ic.2008.10.001"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] K. Kwon, S. Hur, and M.-Y. Park, \u201cImproving robustness via disjunctive statements in imperative programming,\u201d IEICE Trans. Inf. & Syst., vol.E96-D, no.9, pp.2036-2038, Sept. 2013.","DOI":"10.1587\/transinf.E96.D.2036"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.S. Hodas and D. Miller, \u201cLogic programming in a fragment of intuitionistic linear logic,\u201d Information and Computation, vol.110, no.2, pp.327-365, 1994.","DOI":"10.1006\/inco.1994.1036"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, \u201cUniform proofs as a foundation for logic programming,\u201d Annals of Pure and Applied Logic, vol.51, no.1-2, pp.125-157, 1991.","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D. Miller and G. Nadathur, Programming with higher-order logic, Cambridge University Press, 2012.","DOI":"10.1017\/CBO9781139021326"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDL8141\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T02:24:54Z","timestamp":1692239094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDL8141\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edl8141","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}