{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:44:18Z","timestamp":1648644258786},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2009]]},"DOI":"10.1587\/transinf.e92.d.1401","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T05:58:04Z","timestamp":1247032684000},"page":"1401-1411","source":"Crossref","is-referenced-by-count":0,"title":["User-Defined On-Demand Matching"],"prefix":"10.1587","volume":"E92-D","author":[{"given":"Masaki","family":"NAKAMURA","sequence":"first","affiliation":[{"name":"Graduate School of Natural Science and Technology, Kanazawa University"}]},{"given":"Kazuhiro","family":"OGATA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology"}]},{"given":"Kokichi","family":"FUTATSUGI","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas, “Improving on-demand strategy annotations, ” Proc. 9th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'02), pp.1-18, Tbilisi, Georgia, LNAI2514, 2003.","DOI":"10.1007\/3-540-36078-6_1"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Alpuente, S. Escobar, and S. Lucas, “Correct and complete (positive) strategy annotations for OBJ, ” Proc. 4th International Workshop on Rewriting Logic and its Applications, WRLA, Electronic Notes in Theoretical Computer Science, vol.71, pp.70-89, 2004.","DOI":"10.1016\/S1571-0661(05)82529-0"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] R. Diaconescu and K. Futatsugi, “CafeOBJ report, ” World Scientific, 1998.","DOI":"10.1142\/3831"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Eker, “Term rewriting with operation symbol evaluation strategies, ” Proc. 2nd International Workshop on Rewriting Logic and its Applications, WRLA, Electronic Notes in Theoretical Computer Science, vol.15, pp.1-20, 1998.","DOI":"10.1016\/S1571-0661(05)80019-2"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, and J. Meseguer, “Principles of OBJ2, ” Proc. 12th ACM Symposium on Principles of Programming Languages, pp.52-66, 1985.","DOI":"10.1145\/318593.318610"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J.A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud, “Introducing OBJ, ” Software Engineering with OBJ: algebraic specification in action, pp.3-167, Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4757-6541-0_1"},{"key":"7","unstructured":"[7] S. Lucas, “Context-sensitive computations in functional and functional logic programs, ” J. Functional and Logic Programming, vol.1998, no.1, pp.1-61, 1998."},{"key":"8","unstructured":"[8] S. Lucas, “Context-sensitive rewriting strategies, ” Technical Report DSIC-II\/7\/00, 56 pages, Departamento de Sistemas Informaticosy Computacion, UPV, 2000."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Lucas, “Termination of on-demand rewriting and termination of OBJ programs, ” Proc. 3rd International Conference on Principles and Practice of Declarative Programming, PPDP, pp.82-93, 2001.","DOI":"10.1145\/773184.773194"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] A. Middeldorp, “Call by need computations to root-stable form, ” Proc. 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, Paris, pp.94-105, 1997.","DOI":"10.1145\/263699.263711"},{"key":"11","unstructured":"[11] T. Nagaya, Reduction strategy for term rewriting system, Ph.D. thesis, Japan Advanced Institute of Science and Technology, 1999."},{"key":"12","unstructured":"[12] A. Nakagawa, T. Sawada, and K. Futatsugi, CafeOBJ user's manual-ver.1.4.-, https:\/\/2.zoppoz.workers.dev:443\/http\/www.ldl.jaist.ac.jp\/cafeobj\/, 1998."},{"key":"13","unstructured":"[13] M. Nakamura and K. Futatsugi, “The on-demand context-sensitive rewriting, ” IEICE Technical Report, SS2000-33, 2001."},{"key":"14","unstructured":"[14] M. Nakamura and K. Futatsugi, “Completeness and strictness analysis for the evaluation strategy, ” Proc. International Workshop on Rewriting in Proof and Computation, RPC, pp.80-89, 2001."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Nakamura and K. Ogata, “The evaluation strategy for head normal form with and without on-demand flags, ” Proc. 3rd International Workshop on Rewriting Logic and its Applications, WRLA, Electronic Notes in Theoretical Computer Science, vol.36, pp.211-227, 2000.","DOI":"10.1016\/S1571-0661(05)80143-4"},{"key":"16","unstructured":"[16] M. Nakamura, Evaluation strategies for term rewriting systems, Ph.D. thesis, School of Information Science, Japan Advanced Institute of Science and Technology, 2002."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] T. Ogata and K. Futatsugi, “Operational semantics of rewriting with the on-demand evaluation strategy, ” Proc. 15th ACM Symposium on Applied Computing, pp.756-763, 2000.","DOI":"10.1145\/338407.338558"},{"key":"18","unstructured":"[18] R. Plasmeijer and M. Eekelen, “Functional programming and parallel Graph rewriting, ” ADDISON-WESLEY, 1993."},{"key":"19","unstructured":"[19] Terese, Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol.55, Cambridge University Press, 2003."},{"key":"20","unstructured":"[20] Y. Toyama, S. Smetsers, M.C.J.D. van Eekelen, and R. Plasmeijer, “The functional strategy and transitive term rewriting systems, ” in Term Graph Rewriting — Theory and Practice, pp.117-129, John Wiley & sons, 1993."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.jstage.jst.go.jp\/article\/transinf\/E92.D\/7\/E92.D_7_1401\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T06:13:48Z","timestamp":1619417628000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.jstage.jst.go.jp\/article\/transinf\/E92.D\/7\/E92.D_7_1401\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2009]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1587\/transinf.e92.d.1401","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}