{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:39Z","timestamp":1725663519481},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543176"},{"type":"electronic","value":"9783540475583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54317-1_109","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:41:00Z","timestamp":1330209660000},"page":"407-416","source":"Crossref","is-referenced-by-count":0,"title":["Compatibility of order-sorted rewrite rules"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Waldmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, 12th International Colloquium on Automata, Languages and Programming. Proceedings. Nafplion, Greece, LNCS 194, pages 221\u2013231. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0015747"},{"key":"33_CR2","unstructured":"J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Draft, Programming Research Group, University of Oxford and SRI International, 1989."},{"key":"33_CR3","unstructured":"M. Gogolla. \u00dcber partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen. Dissertation, Universit\u00e4t Braunschweig, Naturwissenschaftliche Fakult\u00e4t, 1986."},{"key":"33_CR4","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":"33_CR5","first-page":"297","volume":"2","author":"G. Smolka","year":"1989","unstructured":"G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-sorted equational computation. SEKI-Report SR-87-14, Universit\u00e4t Kaiserslautern, Fachbereich Informatik, 1987. Revised version in H. A\u00eft-Kaci and M. NIvat, editors, Resolution of Equations in Algebraic Structures, volume 2, pages 297\u2013367. Academic Press, 1989.","journal-title":"Resolution of Equations in Algebraic Structures"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schau\u00df. Computational Aspects of an Order-Sorted Logic with Term Declarations. Dissertation, Universit\u00e4t Kaiserslautern, Fachbereich Informatik, 1988.","DOI":"10.1007\/BFb0024065"},{"key":"33_CR7","unstructured":"U. Waldmann. Semantics of order-sorted specifications. Forschungsbericht 297, Universit\u00e4t Dortmund, Fachbereich Informatik, 1989."},{"key":"33_CR8","unstructured":"U. Waldmann. Complexities of order-sorted computations. In preparation, Universit\u00e4t Dortmund, Fachbereich Informatik, 1990."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54317-1_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:32Z","timestamp":1605646412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54317-1_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543176","9783540475583"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-54317-1_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}