{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:13Z","timestamp":1725495733160},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052367","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"138-150","source":"Crossref","is-referenced-by-count":3,"title":["Normalization of S-terms is decidable"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Waldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"12_CR1","unstructured":"H. P. Barendregt. The Lambda Calculus, Its Syntax and Sematics. Elsevier Science Publishers, 1984."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(79)90004-5","volume":"9","author":"J. Bergstra","year":"1979","unstructured":"Jan Bergstra and Jan Willem Klop. Church-Rosser strategies in the Lambda calculus. Theoretical Computer Science, 9:27\u201338, 1979.","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"12_CR4","unstructured":"Jan Willem Klop. Reduction Cycles in Combinatory Logic, pages 193\u2013214. In Seldin and Hindley [SH80], 1980."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/48022.48026","volume":"10","author":"R. Kennaway","year":"1988","unstructured":"Richard Kennaway and Ronan Sleep. Director strings as combinators. ACM Transactions on Programming Languages and Systems, 10(4):602\u2013626, October 1988.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR6","unstructured":"J. P. Seldin and J. R. Hindley, editors. To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, 1980."},{"key":"12_CR7","volume-title":"To Mock a Mockingbird: and other logic puzzles including an amazing adventure in combinatory logic","author":"R. Smullyan","year":"1985","unstructured":"Raymond Smullyan. To Mock a Mockingbird: and other logic puzzles including an amazing adventure in combinatory logic. Knopf, New York, 1985."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0747-7171(89)80044-6","volume":"7","author":"R. Statmann","year":"1989","unstructured":"Richard Statmann. The word problem for Smullyan's lark combinator is decidable. J. Symbolic Comput., 7:103\u2013112, 1989.","journal-title":"J. Symbolic Comput."},{"key":"12_CR9","unstructured":"J. Waldmann. Nimm Zwei. Internal Report IR-432, Vrije Universiteit Amsterdam, Research Group Theoretical Computer Science, September 1997."},{"key":"12_CR10","unstructured":"Efstathios Zachos. Kombinatorische Logik und S-Terme. Berichte des Instituts f\u00fcr Informatik 26, Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich, 1978."},{"key":"12_CR11","unstructured":"H. Zantema and A. Geser. Non-looping rewriting. Technical Report UU-CS-1996-03, Utrecht University, January 1996."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T17:09:59Z","timestamp":1549818599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0052367","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}