{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:34Z","timestamp":1725663514863},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:17Z","timestamp":1330254497000},"page":"393-407","source":"Crossref","is-referenced-by-count":2,"title":["Completeness and confluence of order-sorted term rewriting"],"prefix":"10.1007","author":[{"given":"Lars","family":"With","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"30_CR1","volume-title":"Technical report","author":"H. Chen","year":"1991","unstructured":"H. Chen and J. Hsiang. Order-sorted equational specification and completion. Technical report, State University of New York at Stony Brook, 1991."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. Research report, CNRS-LNRI, 1991.","DOI":"10.1007\/3-540-55719-9_91"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Springer, 1985.","DOI":"10.1007\/978-3-642-69962-7"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. In Proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP), number 299 in Lecture Notes in Computer Science, pages 165\u2013184. Springer, 1988.","DOI":"10.1007\/BFb0026103"},{"key":"30_CR5","unstructured":"M. Gogolla. \u00dcber partiell geordnete Sortennlengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen. PhD thesis, Naturwissenschaftliche Fakult\u00e4t der Technischen Universit\u00e4t Braunschweig, 1986."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, Proceedings of the 12th International Colloquium on Automata, Languages and Programming, number 194 in Lecture Notes in Computer Science, pages 221\u2013231. Springer, 1985.","DOI":"10.1007\/BFb0015747"},{"key":"30_CR7","unstructured":"J. A. Goguen and J. Meseguer. Completeness of many-sorted equational logic. Technical Report CSLI-84-15, Center for the Study of Language and Information, Stanford University, 1984."},{"key":"30_CR8","unstructured":"J. A. Goguen and T. Winkler. Introducing OBJ3. Technical Report SRI-CSL-88-9, SRI International, 1988."},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","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 rewriting systems. J. ACM, 27(4):797\u2013821, 1980.","journal-title":"J. ACM"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"G. Huet and D. C. Oppen. Equations and rewrite rules: A survey. In R, Book, editor, Formal Languages: Perspectives and Open Problems, pages 349\u2013405. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"30_CR11","unstructured":"C. Kirchner and H. Kirchner. Order-sorted computations in G-algebra. Technical report, Centre de Recherche en Informatique de Nancy, 1991."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In T. Lepist\u00f6 and A. Salomaa, editors, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, number 317 in Lecture Notes in Computer Science, pages 287\u2013301. Springer, 1988.","DOI":"10.1007\/3-540-19488-6_123"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"issue":"2","key":"30_CR14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Trans. Prog. Lang. Syst., 4(2):258\u2013282, 1982.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"30_CR15","unstructured":"J. Meseguer and J. A. Goguen. Initiality, induction and computability. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics. Cambridge University Press, 1985."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schauss. Computational Aspects of an Order-Sorted Logic with Term Declarations. Number 395 in Lecture Notes in Artificial Intelligence. Springer, 1989.","DOI":"10.1007\/BFb0024065"},{"key":"30_CR17","unstructured":"G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-sorted equational computation. SEKI Report SR-87-14, Fachbereich Informatik der Universit\u00e4t Kaiserslautern, 1987."},{"issue":"1","key":"30_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90322-7","volume":"94","author":"U. Waldmann","year":"1992","unstructured":"U. Waldmann. Semantics of order-sorted specifications. Theoretical Comput. Sci., 94(1):1\u201336, 1992.","journal-title":"Theoretical Comput. Sci."},{"key":"30_CR19","unstructured":"A. Werner. A semantic approach to order-sorted rewriting. unpublished, 1991."},{"key":"30_CR20","unstructured":"L. With. Linear order-sorted unification. Forschungsberichte des Fachbereichs Informatik 1989-15, Technische Universit\u00e4t Berlin, 1989."},{"key":"30_CR21","unstructured":"L. With. Multi-sort variables \u2014 a new concept for order-sorted unification. Forschungsberichte des Fachbereichs Informatik 1989-19, Technische Universit\u00e4t Berlin, 1989."},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"L. With. Completeness and confluence of order-sorted term rewriting. Forschungsberichte des Fachbereichs Informatik, Technische Universit\u00e4t Berlin, 1992. to appear.","DOI":"10.1007\/3-540-56393-8_30"},{"key":"30_CR23","unstructured":"L. With. Order-sorted unification with term declarations. Forschungsberichte des Fachbereichs Informatik, Technische Universit\u00e4t Berlin, 1992. to appear."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:36Z","timestamp":1605647016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}