{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:21:23Z","timestamp":1725898883209},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591320"},{"type":"electronic","value":"9783540491989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014436","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T18:08:44Z","timestamp":1134324524000},"page":"319-335","source":"Crossref","is-referenced-by-count":2,"title":["Sort inheritance for order-sorted equational presentations"],"prefix":"10.1007","author":[{"given":"Claus","family":"Hintermeier","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"17_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, November 1991."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. In W. Kuich, editor, Proceedings of ICALP 92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_91"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, Proceeding of the 12th International Colloquium on Automata, Languages and Programming, Nafplion (Greece), volume 194 of Lecture Notes in Computer Science, pages 221\u2013231. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0015747"},{"key":"17_CR5","doi-asserted-by":"publisher","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"},{"issue":"105","key":"17_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"2","author":"J. A. Goguen","year":"1992","unstructured":"J. A. Goguen and J. Meseguer. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 2(105):217\u2013273, 1992.","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations-extended abstract-. In S. Abiteboul and E. Shamir, editors, Proc. 21st International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science, pages 450\u2013461. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58201-0_89"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations. research report 2208, INRIA, Inria Lorraine, March 1994. 114 p., also as CRIN report 93-R-309.","DOI":"10.1007\/3-540-58201-0_89"},{"key":"17_CR9","unstructured":"C. Hintermeier, H. Kirchner, and P. Mosses. R n-and G n-logics. Technical report, Centre de Recherche en Informatique de Nancy, 1994."},{"key":"17_CR10","first-page":"257","volume-title":"Computational Logic. Essays in honor of Alan Robinson","author":"J.-P. Jouannaud","year":"1991","unstructured":"J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257\u2013321. The MIT press, Cambridge (MA, USA), 1991."},{"key":"17_CR11","unstructured":"A. M\u00e9grelis. Alg\u00e8bre galactique \u2014 Un proc\u00e9d\u00e9 de calcul formel, relatif aux semi-fonctions, \u00e0 l'inclusion et \u00e0 l'\u00e9galit\u00e9. Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 de Nancy 1, 1990."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"K. Meinke. Algebraic semantics of rewriting terms and types. In M. Rusinowitch and J. R\u00e9my, editors, Proceedings 3rd International Workshop on Conditional Term Rewriting Systems, Pont-\u00e0-Mousson (France), volume 656 of Lecture Notes in Computer Science, pages 1\u201320. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56393-8_1"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"P. D. Mosses. Unified algebras and institutions. In Proceedings 4th IEEE Symposium on Logic in Computer Science, Pacific Grove, pages 304\u2013312, 1989.","DOI":"10.1109\/LICS.1989.39185"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01396685","volume":"145","author":"A. Oberschelp","year":"1962","unstructured":"A. Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik. Math. Annalen, 145(1):297\u2013333, 1962.","journal-title":"Math. Annalen"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"D. Scott. Identity and existence in intuitionistic logic. In M. P. Fourman and C. J. Mulvey, editors, Applications of Sheaves, volume 753 of Lecture Notes in Mathematics, pages 660\u2013696. Springer-Verlag, 1977.","DOI":"10.1007\/BFb0061839"},{"key":"17_CR16","volume-title":"PhD thesis","author":"G. Smolka","year":"1989","unstructured":"G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, FB Informatik, Universit\u00e4t Kaiserslautern, Germany, 1989."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-sorted equational computation. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2: Rewriting Techniques, pages 297\u2013367. Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50016-X"},{"key":"17_CR18","volume-title":"PhD thesis","author":"M. Schmidt-Schau\u00df","year":"1987","unstructured":"M. Schmidt-Schau\u00df. Computational Aspects of an Order-Sorted Logic with Term Declarations. PhD thesis, Universit\u00e4t Kaiserslautern (Germany), 1987."},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","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 Computer Science, 94(1):1\u201333, 1992.","journal-title":"Theoretical Computer Science"},{"key":"17_CR20","unstructured":"P. Watson and J. Dick. Least sorts in order-sorted term rewriting. Technical report, Royal Holloway and Bedford New College, University of London, 1989."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"A. Werner. A semantic approach to order-sorted rewriting. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 47\u201361. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56868-9_5"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"L. With. Completeness and confluence of order-sorted term rewriting. In M. Rusinowitch and J.-L. R\u00e9my, editors, Proceedings 3rd International Workshop on Conditional Term Rewriting Systems, Pont-\u00e0-Mousson (France), number 656 in Lecture Notes in Computer Science, pages 393\u2013407. Springer-Verlag, July 1992.","DOI":"10.1007\/3-540-56393-8_30"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Data Type Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:26:30Z","timestamp":1683321990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591320","9783540491989"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0014436","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}