{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:40:33Z","timestamp":1737376833718,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540731467"},{"type":"electronic","value":"9783540731474"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73147-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T04:01:50Z","timestamp":1187323310000},"page":"89-112","source":"Crossref","is-referenced-by-count":1,"title":["Reduction Strategies and Acyclicity"],"prefix":"10.1007","author":[{"given":"Jan Willem","family":"Klop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"van Oostrom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Femke","family":"van Raamsdonk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0304-3975(96)00041-2","volume":"165","author":"S. Antoy","year":"1996","unstructured":"Antoy, S., Middeldorp, A.: A sequential reduction strategy. Theoretical Computer Science\u00a0165(1), 75\u201395 (1996)","journal-title":"Theoretical Computer Science"},{"key":"5_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"5_CR3","volume-title":"The Lambda Calculus, its Syntax and Semantic, of Studies in Logic and the Foundations of Mathematics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus, its Syntax and Semantic, of Studies in Logic and the Foundations of Mathematics, 2nd edn., vol.\u00a0103. North-Holland, Amsterdam (1984)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Barendregt, H.P., Bergstra, J.A., Klop, J.W., Volken, H.: Degrees, reductions and representability in the lambda calculus. Technical Report\u00a022, Utrecht University (February 1976)","key":"5_CR4","DOI":"10.1016\/S1385-7258(76)80001-7"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(79)90004-5","volume":"9","author":"J.A. Bergstra","year":"1979","unstructured":"Bergstra, J.A., Klop, J.W.: Church-Rosser strategies in the lambda calculus. Theoretical Computer Science\u00a09(1), 27\u201338 (1979)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","volume":"43","author":"J.R. Kennaway","year":"1989","unstructured":"Kennaway, J.R.: Sequential evaluation strategies for parallel-or and related reduction systems. Annals of Pure and Applied Logic\u00a043, 31\u201356 (1989)","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR7","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"65","volume-title":"WRS 2004","author":"J. Ketema","year":"2005","unstructured":"Ketema, J., Klop, J.W., van Oostrom, V.: Vicious circles in orthogonal term rewriting systems. In: Antoy, S., Toyama, Y. (eds.) WRS 2004. Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming. Electronic Notes in Theoretical Computer Science, vol.\u00a0124, pp. 65\u201377. Elsevier, North-Holland, Amsterdam (2005)"},{"unstructured":"Ketema, J., Klop, J.W., van Oostrom, V.: Vicious circles in rewriting systems. In: DiCosmo, R., Toyama, Y. (eds.): WRS 2005. Proceedings of the 5th International Workshop on Reduction Strategies in Rewriting and Programming (2005)","key":"5_CR8"},{"unstructured":"Klop, J.W.: Reduction cycles in Combinatory Logic. In: Hindley, J.R., Seldin, J.P. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 193\u2013214. Academic Press, San Diego (1980) Also available via http:\/\/web.mac.com\/janwillemklop\/iWeb\/Site\/Bibliography.html","key":"5_CR9"},{"issue":"12","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/PL00013300","volume":"36","author":"A. Middeldorp","year":"2000","unstructured":"Middeldorp, A., Ohsaki, H.: Type introduction for equational rewriting. Acta Informatica\u00a036(12), 1007\u20131029 (2000)","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Higher-order critical pairs. In: Proceedings of the 6th annual IEEE Symposium on Logic in Computer Science (LICS 1991), pp. 342\u2013349, Amsterdam, The Netherlands (July 1991)","key":"5_CR11","DOI":"10.1109\/LICS.1991.151658"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Computing in Systems Described by Equations","year":"1977","unstructured":"O\u2019Donnell, M.J.: Computing in Systems Described by Equations. LNCS, vol.\u00a058. Springer, Heidelberg (1977)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-48685-2_5","volume-title":"Rewriting Techniques and Applications","author":"V. Oostrom van","year":"1999","unstructured":"van Oostrom, V.: Normalisation in weakly orthogonal rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 60\u201374. Springer, Heidelberg (1999)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","first-page":"203","volume-title":"Rewriting Techniques and Applications","author":"R. Statman","year":"1997","unstructured":"Statman, R.: Effective reduction and conversion strategies for combinators. In: Comon, H. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a01232, pp. 203\u2013213. Springer, Heidelberg (1997)"},{"key":"5_CR15","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"Terese","year":"2003","unstructured":"Terese,: Term Rewriting Systems. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a055, Cambridge University Press, Cambridge, UK (2003)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/11601548_13","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday","author":"Y. Toyama","year":"2005","unstructured":"Toyama, Y.: Reduction strategies for left-linear term rewriting systems. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 198\u2013223. Springer, Heidelberg (2005)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.2000.2874","volume":"159","author":"J. Waldmann","year":"2000","unstructured":"Waldmann, J.: The combinator S. Information and Computation\u00a0159, 2\u201321 (2000)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Rewriting, Computation and Proof"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73147-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:13:40Z","timestamp":1737375220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73147-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540731467","9783540731474"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73147-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}