{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:48Z","timestamp":1725489348349},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73449-9_24","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"314-328","source":"Crossref","is-referenced-by-count":5,"title":["Random Descent"],"prefix":"10.1007","author":[{"given":"Vincent","family":"van Oostrom","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese.: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. Newman","year":"1942","unstructured":"Newman, M.: On Theories with a Combinatorial Definition of \u201dEquivalence\u201d. Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"24_CR3","first-page":"274","volume-title":"Proceedings of the 7th LICS","author":"Y. Toyama","year":"1992","unstructured":"Toyama, Y.: Strong sequentiality of left-linear overlapping term rewriting systems. In: Proceedings of the 7th LICS, pp. 274\u2013284. IEEE Computer Society Press, Los Alamitos (1992)"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(92)00023-K","volume":"126","author":"V.v. Oostrom","year":"1994","unstructured":"Oostrom, V.v.: Confluence by decreasing diagrams. Theoretical Computer Science\u00a0126(2), 259\u2013280 (1994)","journal-title":"Theoretical Computer Science"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-61064-2_44","volume-title":"Trees in Algebra and Programming - CAAP 1996","author":"M. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.: Efficient longest and infinite reduction paths in untyped \u03bb-calculi. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 287\u2013301. Springer, Heidelberg (1996)"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0890-5401(87)90001-0","volume":"75","author":"H. Barendregt","year":"1987","unstructured":"Barendregt, H., Kennaway, R., Klop, J., Sleep, M.: Needed reduction and spine strategies for the lambda calculus. Information and Computation\u00a075(3), 191\u2013231 (1987)","journal-title":"Information and Computation"},{"key":"24_CR7","unstructured":"Bloo, R.: Preservation of Termination for Explicit Substitution. PhD thesis, Technische Universiteit Eindhoven (1997)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45127-7_11","volume-title":"Rewriting Techniques and Applications","author":"Z. Khasidashvili","year":"2001","unstructured":"Khasidashvili, Z., Ogawa, M., van Oostrom, V.: Uniform Normalisation beyond Orthogonality. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 122\u2013136. Springer, Heidelberg (2001)"},{"key":"24_CR9","unstructured":"Bonelli, E.: Substitutions explicites et r\u00e9\u00e9criture de termes. PhD thesis, Paris XI (2001)"},{"key":"24_CR10","unstructured":"Oostrom, V.v.: Bowls and Beans, Available from author\u2019s homepage (2004)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-32033-3_17","volume-title":"Term Rewriting and Applications","author":"A. Simpson","year":"2005","unstructured":"Simpson, A.: Reduction in a linear lambda-calculus with applications to operational semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"24_CR12","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61549-8","volume-title":"Confluent String Rewriting","author":"M. Jantzen","year":"1988","unstructured":"Jantzen, M.: Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science, vol.\u00a014. Springer, Heidelberg (1988)"},{"key":"24_CR13","first-page":"95","volume-title":"Proceedings of the 17th POPL","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th POPL, pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E. Stark","year":"1989","unstructured":"Stark, E.: Concurrent transition systems. Theoretical Computer Science\u00a064, 221\u2013269 (1989)","journal-title":"Theoretical Computer Science"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/11601548_13","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","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":"24_CR16","unstructured":"Gramlich, B.: On some abstract termination criteria, WST\u00a01999, Talk (1999)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-32033-3_2","volume-title":"Proceedings of the 16th RTA","author":"J.v.d. Pol","year":"2005","unstructured":"Pol, J.v.d., Zantema, H.: Generalized innermost rewriting. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 2\u201316. Springer, Heidelberg (2005)"},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1995.1145","volume":"122","author":"U. de\u2019Liguoro","year":"1995","unstructured":"de\u2019Liguoro, U., Piperno, A.: Nondeterministic extensions of untyped \u03bb-calculus. Information and Computation\u00a0122(2), 149\u2013177 (1995)","journal-title":"Information and Computation"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0304-3975(99)00215-7","volume":"239","author":"M. Krishna Rao","year":"2000","unstructured":"Krishna Rao, M.: Some characteristics of strong innermost normalization. Theoretical Computer Science\u00a0239, 141\u2013164 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-32033-3_3","volume-title":"Term Rewriting and Applications","author":"M.L. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M.L., Godoy, G., Rubio, A.: Orderings for innermost termination. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 17\u201331. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T01:01:25Z","timestamp":1550797285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734475","9783540734499"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}