{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:02Z","timestamp":1761611162005},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01810293","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T21:54:02Z","timestamp":1119909242000},"page":"79-96","source":"Crossref","is-referenced-by-count":30,"title":["Termination by completion"],"prefix":"10.1007","volume":"1","author":[{"given":"Fran\u00e7oise","family":"Bellegarde","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01810293_CR1","unstructured":"Bachmair, L.: Proof by consistency in equational theories. Technical Report, SUNY at Stony Brook USA, 1988"},{"key":"BF01810293_CR2","first-page":"5","volume-title":"Proceedings 8th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 230","author":"L. Bachmair","year":"1986","unstructured":"Bachmair, L., Dershowitz, N.: Commutation, transformation and termination. In: Siekmann, J. (ed.) Proceedings 8th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 230, pp. 5\u201320. Berlin, Heidelberg, New York: Springer 1986"},{"key":"BF01810293_CR3","unstructured":"Bachmair, L., Dershowitz, N., Hsiang, J.: Orderings for equational proofs. In: Proceedings Symp. Logic in Computer Science. IEEE, 346\u2013357 (1986)"},{"key":"BF01810293_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6423(86)90017-1","volume":"6","author":"F. Bellegarde","year":"1986","unstructured":"Bellegarde, F.: Rewriting systems onFP expressions to reduce the number of sequences yielded. Sci. Comput. Programming6, 11\u201334 (1986)","journal-title":"Sci. Comput. Programming"},{"key":"BF01810293_CR5","unstructured":"Bellegarde, F.: Utilisation des syst\u00e8mes de r\u00e9\u00e9criture d'expressions fonctionnelles comme outils de transformation de programmes it\u00e9ratifs. Th\u00e8se de doctorat d'Etat, Universit\u00e9 de Nancy I, 1985"},{"key":"BF01810293_CR6","unstructured":"Bellegarde, F., Lescanne, P.: Termination proofs based on transformation techniques. Internal Report 86-R-034. Centre de Recherche en Informatique de Nancy, 1986"},{"key":"BF01810293_CR7","first-page":"69","volume-title":"12th Coll. on Trees in Algebra and Programming. TAPSOFT. Lecture Notes in Computer Science, vol. 249","author":"F. Bellegarde","year":"1987","unstructured":"Bellegarde, F., Lescanne, P.: Transformation orderings. In: 12th Coll. on Trees in Algebra and Programming. TAPSOFT. Lecture Notes in Computer Science, vol. 249, pp. 69\u201380. Berlin, Heidelberg, New York: Springer 1987"},{"key":"BF01810293_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. BenCherifa","year":"1987","unstructured":"BenCherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Programming9, 137\u2013160 (1987)","journal-title":"Sci. Comput. Programming"},{"key":"BF01810293_CR9","volume-title":"Categorical combinators, sequential algorithms and functional programming","author":"P.L. Curien","year":"1986","unstructured":"Curien, P.L.: Categorical combinators, sequential algorithms and functional programming. New York: Pitman Press 1986"},{"key":"BF01810293_CR10","first-page":"109","volume-title":"Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill. North Carolina, USA. Lecture Notes in Computer Science, vol. 355","author":"M. Dauchet","year":"1989","unstructured":"Dauchet, M.: Simulation of Turing machines by a left-linear rewrite rule. In: Dershowitz, N. (ed.) Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill. North Carolina, USA. Lecture Notes in Computer Science, vol. 355, pp. 109\u2013120. Berlin, Heidelberg, New York: Springer 1989"},{"key":"BF01810293_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. Theoret. Comput. Sci.17, 279\u2013301 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"BF01810293_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. Symb. Comput.3, 69\u2013116 (1987)","journal-title":"J. Symb. Comput."},{"key":"BF01810293_CR13","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Van Leuven (ed.) Handbook of Theoretical Computer Science. Amsterdam, New York: North-Holland 1990"},{"key":"BF01810293_CR14","unstructured":"Galabertier, B.: Impl\u00e9mentation de l'ordre de terminaison par transformation. Technical Report, Centre de Recherche en Informatique de Nancy, 1988"},{"key":"BF01810293_CR15","volume-title":"Relative termination","author":"A. Geser","year":"1990","unstructured":"Geser, A.: Relative termination. Dissertation thesis, Universit\u00e4t Passau, West Germany, 1990"},{"key":"BF01810293_CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(86)90035-6","volume":"46","author":"T. Hardin","year":"1986","unstructured":"Hardin, T., Laville, A.: Proof of termination of the rewriting system SUBST on CCL. Theoret. Comput. Sci.46, 305\u2013312 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"BF01810293_CR17","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. Assoc. Comput. Machinery27, 797\u2013821 (1980) Preliminary version in 18th Symposium on Foundations of Computer Science, IEEE, 1977","journal-title":"J. Assoc. Comput. Machinery"},{"key":"BF01810293_CR18","volume-title":"On the uniform halting problem for term rewriting systems. Technical Report 283","author":"G. Huet","year":"1978","unstructured":"Huet, G., Lankford, D.-S.: On the uniform halting problem for term rewriting systems. Technical Report 283, Laboria, France, 1978"},{"key":"BF01810293_CR19","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Attemps for generalizing the recursive path ordering. 1980. Unpublished manuscript"},{"key":"BF01810293_CR20","volume-title":"On Proving Term Rewriting Systems are Noetherian. Technical Report","author":"D.S. Lankford","year":"1979","unstructured":"Lankford, D.S.: On Proving Term Rewriting Systems are Noetherian. Technical Report, Louisiana Tech. University, Mathematics Department, Ruston LA, 1979"},{"key":"BF01810293_CR21","first-page":"28","volume-title":"TAPSOFT'89. Lecture Notes in Computer Science, Vol. 351","author":"P. Lescanne","year":"1989","unstructured":"Lescanne, P.: Completion procedures as transition rules + control. In: Diaz, M., Orejas, F. (ed.) TAPSOFT'89. Lecture Notes in Computer Science, Vol. 351, pp. 28\u201341. Berlin, Heidelberg, New York: Springer 1989"},{"key":"BF01810293_CR22","unstructured":"Plaisted, D.: A recursively defined ordering for proving termination of term rewriting systems. Technical Report R-78-943, University of Illinois, Department of Computer Science, 1978"},{"key":"BF01810293_CR23","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0747-7171(87)80023-8","volume":"3","author":"M. Rusinowitch","year":"1987","unstructured":"Rusinowitch, M.: Path of subterms ordering and recursive decomposition ordering revisited. J. Symb. Comput.3, 117\u2013132 (1987)","journal-title":"J. Symb. Comput."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01810293.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01810293\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01810293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:57:07Z","timestamp":1557417427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01810293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01810293"],"URL":"https:\/\/doi.org\/10.1007\/bf01810293","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}