{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:33Z","timestamp":1742617173855,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:33:30Z","timestamp":1330270410000},"page":"450-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Dynamically-typed computations 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,5,29]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"L. Bachmair. Canonical equational proofs. Computer Science Logic, Progress in Theoretical Computer Science. Birkh\u00e4user Verlag AG, 1991.","DOI":"10.1007\/978-1-4684-7118-2"},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"G. Birkhoff. On the structure of abstract algebras. Proceedings Cambridge Phil. Soc., 31:433\u2013454, 1935.","journal-title":"Proceedings Cambridge Phil. Soc."},{"key":"37_CR3","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":"37_CR4","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":"37_CR5","first-page":"244","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","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."},{"key":"37_CR6","unstructured":"H. Ganzinger. Order-sorted completion: the many-sorted way. In Proceedings International Joint Conference on Theory and Practice of Software Development: Colloquium on Software Engineering, Lecture Notes in Computer Science. Springer-Verlag, 1989."},{"key":"37_CR7","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 ordersorted algebras. Theoretical Computer Science, 72:169\u2013202, 1990.","journal-title":"Theoretical Computer Science"},{"issue":"105","key":"37_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"1","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, 1(105):217\u2013273, 1992.","journal-title":"Theoretical Computer Science"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations. Technical Report 93-R-309, CRIN, 1993.","DOI":"10.1007\/3-540-58201-0_89"},{"issue":"3","key":"37_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0743-1066(92)90027-Z","volume":"12","author":"J.-P. Jouannaud","year":"1992","unstructured":"J.-P. Jouannaud, C. Kirchner, H. Kirchner, and A. M\u00e9grelis. Programming with equalities, subsorts, overloading and parameterization in OBJ. Journal of Logic Programming, 12(3):257\u2013280, February 1992.","journal-title":"Journal of Logic Programming"},{"key":"37_CR11","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, Oxford, 1970."},{"issue":"3","key":"37_CR12","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue d'Intelligence Artificielle, 4(3):9\u201352, 1990. Special issue on Automatic Deduction.","journal-title":"Revue d'Intelligence Artificielle"},{"key":"37_CR13","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 I, 1990."},{"key":"37_CR14","series-title":"volume 656 of Lecture Notes in Computer Science","first-page":"1","volume-title":"Proceedings 3rd International Workshop on Conditional Rewriting Systems, Pont-\u00e0-Mousson","author":"K. Meinke","year":"1992","unstructured":"K. Meinke. Algebraic semantics of rewriting terms and types. In M. Rusinowitch and J.L. R\u00e9my, editors, Proceedings 3rd International Workshop on Conditional Rewriting Systems, Pont-\u00e0-Mousson (France), volume 656 of Lecture Notes in Computer Science, pages 1\u201320. Springer-Verlag, 1992."},{"key":"37_CR15","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\u20132","key":"37_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(90)90118-2","volume":"77","author":"V. Manca","year":"1990","unstructured":"V. Manca, A. Salibra, and G. Scollo. Equational type logic. Theoretical Computer Science, 77(1\u20132):131\u2013159, 1990.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"37_CR17","doi-asserted-by":"crossref","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":"37_CR18","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":"37_CR19","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":"37_CR20","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":"37_CR21","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 in order-sorted specifications. Theoretical Computer Science, 94(1):1\u201333, 1992.","journal-title":"Theoretical Computer Science"},{"key":"37_CR22","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":"37_CR23","series-title":"volume 690 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-56868-9_5","volume-title":"Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal","author":"A. Werner","year":"1993","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."},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings 3rd International Workshop on Conditional Rewriting Systems, Pont-\u00e0-Mousson","author":"L. With","year":"1992","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 Rewriting Systems, Pont-\u00e0-Mousson (France), Lecture Notes in Computer Science. Springer-Verlag, July 1992."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:23:28Z","timestamp":1742595808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_89"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}