{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:46Z","timestamp":1725664786312},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:16Z","timestamp":1330292416000},"page":"377-391","source":"Crossref","is-referenced-by-count":0,"title":["Semantics and strong sequentially of priority term rewriting systems"],"prefix":"10.1007","author":[{"given":"Masahiko","family":"Sakai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihito","family":"Toyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(89)90006-6","volume":"67","author":"J. C. M. Baeten","year":"1989","unstructured":"J. C. M. Baeten, J. A. Bergstra, J. W. Klop, and W. P. Weijland. Term rewriting systems with rule priorities. Theoretical Computer Science, 67:283\u2013301, 1989.","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"H. Comon. Sequentiality, second order monadic logic and tree automata. In Logic in Computer Science, pages 508\u2013517, 1995.","DOI":"10.1109\/LICS.1995.523285"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershouwitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"29_CR4","unstructured":"P. Henderson. Functional Programming. Prentice Hall International, 1980."},{"key":"29_CR5","unstructured":"G. Huet and J.-J. L\u00e9vy. Call by need computations in non-ambiguous linear term rewriting systems. Technical Report 359, INRIA, 1979."},{"issue":"4","key":"29_CR6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of Association for Computing Machinery, 27(4):797\u201321, October 1980.","journal-title":"Journal of Association for Computing Machinery"},{"key":"29_CR7","unstructured":"S. L. P. Jones. The Implementation of Functional Programming Languages. Prentice Hall International, 1987."},{"key":"29_CR8","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I. Oxford University Press, 1992."},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J. W. Klop","year":"1991","unstructured":"J. W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewritng systems. J. Symbolic Computation, 12:161\u2013195, 1991.","journal-title":"J. Symbolic Computation"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"C. K. Mohan. Priority rewriting: Semantics, confluence, and conditionals. In LNCS, volume 355, pages 278\u2013291. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_114"},{"key":"29_CR11","unstructured":"R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-wesley, 1993."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595\u2013629. North-Holland, 1977.","DOI":"10.1016\/S0049-237X(08)71116-9"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Y. Toyama. Strong sequentiality of left-linear overlapping term rewriting systems. In Proc. of the 7'th annual IEEE Symposium on Login in Computer Science, pages 274\u2013284, 1992.","DOI":"10.1109\/LICS.1992.185540"},{"key":"29_CR15","unstructured":"Y. Toyama, S. Smetsers, M. van Eekelen, and R. Plasmeijer. The Functional Strategy and Transitive Term Rewriting Systems. In Ronan Sleep, Rinus Plasmeijer, and Marko van Eelkelen, editors, Term Graph Rewriting: Theory and Practice, pages 61\u201375. John Wiley & Sons Ltd, 1993."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:34Z","timestamp":1605647194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}