{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:03Z","timestamp":1742598603250,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584315"},{"type":"electronic","value":"9783540487913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58431-5_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:06:06Z","timestamp":1330272366000},"page":"168-185","source":"Crossref","is-referenced-by-count":1,"title":["A sequential reduction strategy"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. A. Bergstra","year":"1986","unstructured":"J.A. Bergstra and J.W. Klop, Conditional Rewrite Rules: Confluence and Termination, Journal of Computer and System Sciences 32(3), pp. 323\u2013362, 1986.","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B (ed. J. van Leeuwen), North-Holland, pp. 243\u2013320, 1990.","key":"13_CR2","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"unstructured":"G. Huet and J.-J. L\u00e9vy, Computations in Orthogonal Rewriting Systems, I and II, in: Computational Logic, Essays in Honor of Alan Robinson (eds. J.-L. Lassez and G. Plotkin), The MIT Press, pp. 396\u2013443, 1991. Previous version: Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems, report 359, INRIA, 1979.","key":"13_CR3"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","volume":"43","author":"J. R. Kennaway","year":"1989","unstructured":"J.R. Kennaway, Sequential Evaluation Strategies for Parallel-Or and Related Reduction Systems, Annals of Pure and Applied Logic 43, pp. 31\u201356, 1989.","journal-title":"Annals of Pure and Applied Logic"},{"key":"13_CR5","volume-title":"Ph.D. thesis, Mathematical Centre Tracts 127","author":"J. W. Klop","year":"1980","unstructured":"J.W. Klop, Combinatory Reduction Systems, Ph.D. thesis, Mathematical Centre Tracts 127, Centre for Mathematics and Computer Science, Amsterdam, 1980."},{"unstructured":"J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. II (eds. S. Abramsky, D. Gabbay and T. Maibaum), Oxford University Press, pp. 1\u2013116, 1992.","key":"13_CR6"},{"doi-asserted-by":"crossref","unstructured":"M.J. O'Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science 58, 1977.","key":"13_CR7","DOI":"10.1007\/3-540-08531-9"},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0222010","volume":"22","author":"M. Oyamaguchi","year":"1993","unstructured":"M. Oyamaguchi, NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term Rewriting Systems, SIAM Journal on Computation 22(1), pp. 114\u2013135, 1993.","journal-title":"SIAM Journal on Computation"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-15976-2_14","volume":"202","author":"S. Porat","year":"1985","unstructured":"S. Porat and N. Francez, Fairness in Term Rewriting Systems, Proceedings of the 1st International Conference on Rewriting Techniques and Applications, Bordeaux, Lecture Notes in Computer Science 202, pp. 287\u2013300, 1985.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R.C. Sekar and I.V. Ramakrishnan, Programming in Equationai Logic: Beyond Strong Sequentiality, Proceedings of the 5th IEEE Symposium on Logic in Computer Science, Philadelphia, pp. 230\u2013241, 1990.","key":"13_CR10","DOI":"10.1109\/LICS.1990.113749"},{"doi-asserted-by":"crossref","unstructured":"Y. Toyama, Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems, Proceedings of the 7th IEEE Symposium on Logic in Computer Science, Santa Cruz, pp. 274\u2013284, 1992.","key":"13_CR11","DOI":"10.1109\/LICS.1992.185540"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58431-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:29:14Z","timestamp":1742596154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58431-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584315","9783540487913"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58431-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}