{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:07:39Z","timestamp":1649146059866},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Compt. Sci. & Technol."],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1007\/bf02939479","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T05:09:40Z","timestamp":1220418580000},"page":"162-171","source":"Crossref","is-referenced-by-count":1,"title":["Nonterminating rewritings with head boundedness"],"prefix":"10.1007","volume":"8","author":[{"given":"Chen","family":"Yiyun","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"BF02939479_CR1","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 rewirting systems.JACM, 1980, 27(4), 797\u2013821.","journal-title":"JACM"},{"issue":"1\u20132","key":"BF02939479_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"Nachum Dershowitz","year":"1987","unstructured":"Nachum Dershowitz, Termination of rewriting.J. Symbolic Computation, 1987, 3(1\u20132), 69\u2013115; 1987, 4(3), 409\u2013410.","journal-title":"J. Symbolic Computation"},{"key":"BF02939479_CR3","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and St\u00e9phane Kaplan. Rewrite, rewrite, rewrite, rewrite, rewrite\u2026, Proc. 16-th ACM Symp. on Principles of Programming Languages, Austin, TX, 1989, 250\u2013259.","DOI":"10.1145\/75277.75299"},{"key":"BF02939479_CR4","doi-asserted-by":"crossref","unstructured":"D. A. Turner, Miranda: A non-strict functional language with polymorphic types. LNCS 201, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"BF02939479_CR5","unstructured":"P. Hudaket al., Report on the Functional Programming Language Haskell. Draft Proposed Standard, 1988."},{"key":"BF02939479_CR6","volume-title":"Equational Logic as a Programming Language","author":"M. J. O'Donnell","year":"1985","unstructured":"M. J. O'Donnell, Equational Logic as a Programming Language, MIT Press, Cambridge, MA, 1985."},{"key":"BF02939479_CR7","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz, St\u00e9phane Kaplan and David A. Plaisted, Infinite normal forms. LNCS 372, Springer-Verlag, 1989, 249\u2013262.","DOI":"10.1007\/BFb0035765"},{"issue":"1","key":"BF02939479_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"Nachum Dershowitz","year":"1991","unstructured":"Nachum Dershowitz, St\u00e9phane Kaplan and David A. Plaisted, Rewrite, rewrite, rewrite, rewrite, rewrite\u2026,Theoretical Computer Science, 1991, 83(1), 71\u201396.","journal-title":"Theoretical Computer Science"},{"key":"BF02939479_CR9","volume-title":"Robert Feys and William Craig, Combinatory Logic, Volume I","author":"Haskell B. Curry","year":"1958","unstructured":"Haskell B. Curry, Robert Feys and William Craig, Combinatory Logic, Volume I. North-Holland Publishing Company, Amsterdam, 1958."},{"key":"BF02939479_CR10","doi-asserted-by":"crossref","unstructured":"Yiyun Chen and Michael J. O'Donnell, Testing confluence of nonterminating rewriting systems. Technical Report 90-07, The University of Chicago; also in LNCS 516, 127\u2013136.","DOI":"10.1007\/3-540-54317-1_85"},{"key":"BF02939479_CR11","series-title":"Report CS-R904","volume-title":"Transfinite Reductions in Orthogonal Term Rewriting Systems","author":"J. R. Kennaway","year":"1990","unstructured":"J. R. Kennaway, J. W. Klop, M. R. Sleep and F. J. De Vries, Transfinite Reductions in Orthogonal Term Rewriting Systems. Report CS-R904, CWI, Amsterdam, 1990."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939479.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02939479\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T22:59:11Z","timestamp":1558565951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02939479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["BF02939479"],"URL":"https:\/\/doi.org\/10.1007\/bf02939479","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}