{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:42Z","timestamp":1725663402825},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176602"},{"type":"electronic","value":"9783540477464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17660-8_48","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:17:41Z","timestamp":1330197461000},"page":"69-80","source":"Crossref","is-referenced-by-count":8,"title":["Transformation ordering"],"prefix":"10.1007","author":[{"given":"F.","family":"Bellegarde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Lescanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"6_CR1","volume-title":"Lecture Notes in Computer Science, vol. 230","author":"L. Bachmair","year":"1986","unstructured":"L. Bachmair and N. Dershowitz, \"Commutation, Transformation, and Termination,\" in Proc. 8th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 230, Springer Verlag, Oxford (England), 1986."},{"key":"6_CR2","first-page":"241","volume-title":"Lecture Notes in Computer Science, vol. 202","author":"L. Bachmair","year":"1985","unstructured":"L. Bachmair and D. Plaisted, \"Associative Path Orderings,\" in tProc. 1st Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 241\u2013254, Springer Verlag, Dijon (France), 1985."},{"issue":"8","key":"6_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus, \"Can Programming Be Liberated From the Von Neumann Style? A Functional Style And Its Algebra of Programs,\" Comm. of ACM, vol. 21, no. 8, pp. 613\u2013641, 1978.","journal-title":"Comm. of ACM"},{"key":"6_CR4","unstructured":"F. Bellegarde, \"Utilisation des Syst\u00e8mes de R\u00e9\u00e9criture d'Expressions Fonctionnelles comme outiles de Transformation de Programmes It\u00e9ratifs,\" Th\u00e8se de doctorat d'Etat, Universit\u00e9 de Nancy I, Dept. Math\u00e9matiques Appliqu\u00e9es, 1985."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0167-6423(86)90017-1","volume":"6","author":"F. Bellegarde","year":"1986","unstructured":"F. Bellegarde, \"Rewriting Systems on FP Expressions to reduce the number of Sequences Yielded.\" Science of Computer Programming, vol. 6. pp. 11\u201334, North-Holland, 1986.","journal-title":"Science of Computer Programming"},{"key":"6_CR6","unstructured":"F. Bellegarde and P. Lescanne, \"Termination Proofs Based On Transformation Techniques,\" Submitted To Information and Control, 1986."},{"key":"6_CR7","first-page":"180","volume-title":"Lecture Notes in Computer Science, Vol. 202","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz, \"Termination,\" in Proc. 1rst Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 202, pp. 180\u2013224, Springer Verlag, Dijon (France), May 1985."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"I. Gnaedig and P. Lescanne, \"Proving Termination of Associative Commutative Rewriting Systems by Rewriting,\" Proceedings 8th International Conference on Automated Deduction, Oxford (England), 27\u201331 July 1986.","DOI":"10.1007\/3-540-16780-3_79"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"G. Huet and D. Oppen, \"Equations and Rewrite Rules: A Survey,\" in Formal Languages: Perspectives And Open Problems, ed. Book R., Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"6_CR10","unstructured":"S. Kamin and J.J. Levy, \"Attempts for Generalizing the Recursive Path Ordering,\" Inria, Rocquencourt, 1982, University of Illinois Report."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17660-8_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:10Z","timestamp":1605643990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17660-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176602","9783540477464"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-17660-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}