{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:35Z","timestamp":1725455915155},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013818","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"37-52","source":"Crossref","is-referenced-by-count":3,"title":["Termination of order-sorted rewriting"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Gnaedig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(86)90019-8","volume":"46","author":"G. Bernot","year":"1986","unstructured":"G. Bernot, M. Bidoit, and C. Choppy. Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors. Theoretical Computer Science, 46:13\u201345, 1986.","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"4_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69\u2013116,1987.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR4","unstructured":"I. Gnaedig. Termination of rewriting in order-sorted algebras. Technical Report 91-R-108, Centre de Recherche en Informatique de Nancy, 1991."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"I. Gnaedig. ELIOS-OBJ: Theorem proving in a specification language. In B. Krieg-Br\u00fcckner, editor, Proceedings of the 4th European Symposium on Programming, pages 182\u2013199. Lecture Notes in Computer Science, February 1992. Volume 582.","DOI":"10.1007\/3-540-55253-7_11"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(90)90034-F","volume":"72","author":"I. Gnaedig","year":"1990","unstructured":"I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. Theoretical Computer Science, 72:169\u2013202, 1990.","journal-title":"Theoretical Computer Science"},{"key":"4_CR7","unstructured":"J. A. Goguen and J. Meseguer. Order-sorted algebra I: Partial and overloaded operations, errors and inheritance. Technical report, SRI International, Computer Science Lab, 1988. Given as lecture at a Seminar on Types, Carnegie-Mellon University, June 1983."},{"key":"4_CR8","unstructured":"J. A. Goguen, J. Meseguer, and D. Plaisted. Programming with parameterized abstract objects in OBJ. Theory And Practice of Software Technology, pages 163\u2013193, 1982."},{"key":"4_CR9","unstructured":"John V. Guttag, James J. Horning, and J. M. Wing. Larch in five easy pieces. Technical report, Digital Systems Research Center, 1985."},{"key":"4_CR10","unstructured":"J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambdacalculus. Cambridge University, 1986."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules: A survey. In R. V. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405. Academic Press, New York, 1980."},{"key":"4_CR12","unstructured":"S. Kamin and J.-J. L\u00e9vy. Attempts for generalizing the recursive path ordering. Inria, Rocquencourt, 1982."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In Proceedings of 15th International Colloquium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 287\u2013301. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_123"},{"key":"4_CR14","volume-title":"Tel (version 0.9), report and user manual. SEKI report SR-87-11","author":"G. Smolka","year":"1988","unstructured":"G. Smolka. Tel (version 0.9), report and user manual. SEKI report SR-87-11, Universit\u00e4t Kaiserslautern (Germany), 1988."},{"issue":"1","key":"4_CR15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1986","unstructured":"Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the Association for Computing Machinery, 34(1):128\u2013143, January 1986.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013818.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:08:09Z","timestamp":1607353689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0013818","relation":{},"subject":[]}}