{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:17Z","timestamp":1761596717038},"reference-count":44,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0304-3975(92)90322-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-35","source":"Crossref","is-referenced-by-count":25,"title":["Semantics of order-sorted specifications"],"prefix":"10.1016","volume":"94","author":[{"given":"Uwe","family":"Waldmann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90322-7_BIB1","series-title":"Ph.D. Thesis","article-title":"Proof methods for equational theories","author":"Bachmair","year":"1987"},{"key":"10.1016\/0304-3975(92)90322-7_BIB2","series-title":"Proof methods for equational theories","author":"Bachmair","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB3","first-page":"1169","article-title":"On the solution of Schubert's Streamroller in many sorted logic","author":"Cohn","year":"1985","journal-title":"Proc. 9th Internat. Joint Conf. Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90322-7_BIB4","series-title":"Th\u00e8se de doctorat","article-title":"Unification et disunification: Th\u00e9orie et applications","author":"Comon","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB5","first-page":"674","article-title":"Equational formulas in order-sorted algebras","volume":"Vol. 443","author":"Comon","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB6","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB7","series-title":"The Second Internat. Workshop on Conditional and Typed Rewrite Systems","first-page":"73","article-title":"Typed completion (extended abstract)","author":"Duponcheel","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB8","series-title":"Fundamentals of Algebraic Specification 1: Equations and Initial Semantics","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(92)90322-7_BIB9","series-title":"Proc. 12th ACM Symposium on Principles of Programming Languages","first-page":"52","article-title":"Principles of OBJ-2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/0304-3975(92)90322-7_BIB10","first-page":"280","article-title":"Rewriting in order-sorted equational logic","volume":"Vol. 1","author":"Gallier","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB11","first-page":"3","article-title":"Order-sorted completion: The many-sorted way","volume":"274","author":"Ganzinger","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB12","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(92)90322-7_BIB13","first-page":"165","article-title":"Equational completion in order-sorted algebras (extended abstract)","volume":"Vol. 299","author":"Gnaedig","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB14","series-title":"Forschungsbericht","first-page":"139","article-title":"Algebraic specifications with partially ordered sorts and declarations","volume":"169","author":"Gogolla","year":"1983"},{"key":"10.1016\/0304-3975(92)90322-7_BIB15","series-title":"Dissertation","article-title":"\u00dcber partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen","author":"Gogolla","year":"1986"},{"key":"10.1016\/0304-3975(92)90322-7_BIB16","first-page":"221","article-title":"Operational semantics for order-sorted algebra","volume":"Vol. 194","author":"Goguen","year":"1985"},{"key":"10.1016\/0304-3975(92)90322-7_BIB17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/947864.947865","article-title":"Completeness of many-sorted equational logic","volume":"16","author":"Goguen","year":"1981","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0304-3975(92)90322-7_BIB18","series-title":"SRI International and Center for the Study of Language and Information","article-title":"Order-sorted algebra I: Partial and overloaded operators, errors and inheritance, Draft","author":"Goguen","year":"1985"},{"key":"10.1016\/0304-3975(92)90322-7_BIB19","series-title":"Proc. Second Symp. on Logic in Computer Science","first-page":"18","article-title":"Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems","author":"Goguen","year":"1987"},{"key":"10.1016\/0304-3975(92)90322-7_BIB20","series-title":"Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Draft","author":"Goguen","year":"1989"},{"key":"10.1016\/0304-3975(92)90322-7_BIB21","series-title":"Specification of Reliable Software","first-page":"170","article-title":"An introduction to OBJ","author":"Goguen","year":"1979"},{"key":"10.1016\/0304-3975(92)90322-7_BIB22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90322-7_BIB23","series-title":"Complexity of automaton identification from given data","author":"Gold","year":"1974"},{"key":"10.1016\/0304-3975(92)90322-7_BIB24","series-title":"8th Coll. on Trees in Algebra and Programming","first-page":"269","article-title":"Confluent and coherent equational term rewriting systems, applications to proofs in abstract data types","volume":"Vol. 159","author":"Jouannaud","year":"1983"},{"key":"10.1016\/0304-3975(92)90322-7_BIB25","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","article-title":"Completion of a set of rules modulo a set of equations","volume":"15","author":"Jouannaud","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90322-7_BIB26","article-title":"Order-sorted equational unification","volume":"954","author":"Kirchner","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB27","series-title":"15th Internat. Coll. on Automata, Languanges and Programming","first-page":"287","article-title":"Operational semantics of OBJ-3 (extended abstract)","volume":"Vol. 317","author":"Kirchner","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB28","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(92)90322-7_BIB29","series-title":"7th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"165","article-title":"Relation-sorted algebraic specifications with built-in coercers: Basic notions and results","volume":"Vol. 415","author":"Kreowski","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB30","series-title":"Tech. Report CRIN 89-R-058","article-title":"A logic of semi-functions, inclusion and equality. The setting","author":"Aristide","year":"1989"},{"key":"10.1016\/0304-3975(92)90322-7_BIB31","series-title":"Tech. Report CSLI-87-86","first-page":"383","article-title":"Order-sorted unification","author":"Meseguer","year":"1987"},{"key":"10.1016\/0304-3975(92)90322-7_BIB32","series-title":"Tech. Report 200","article-title":"Type classes and overloading resolution via order-sorted unification","author":"Nipkow","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB33","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01396685","article-title":"Untersuchungen zur mehrsortigen Quantorenlogik","volume":"145","author":"Oberschelp","year":"1962","journal-title":"Mathematische Annalen"},{"key":"10.1016\/0304-3975(92)90322-7_BIB34","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0022-0000(90)90013-B","article-title":"Parametrization for order-sorted algebraic specification","volume":"40","author":"Poign\u00e9","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90322-7_BIB35","first-page":"1162","article-title":"A many-sorted calculus with polymorphic functions based on resolution and paramodulation","author":"Schmidt-Schau\u03b2","year":"1985","journal-title":"Proc. 9th Internat. Joint Conf. Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90322-7_BIB36","series-title":"Dissertation","article-title":"Computational aspects of an order-sorted logic with term declarations","author":"Schmidt-Schau\u03b2","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB37","series-title":"SEKI-Report SR-86-17","article-title":"Order-sorted Horn logic: Semantics and deduction","author":"Smolka","year":"1986"},{"key":"10.1016\/0304-3975(92)90322-7_BIB38","series-title":"SEKI-Report SR-87-11","article-title":"TEL (Version 0.9): Report and user manual","author":"Smolka","year":"1988"},{"key":"10.1016\/0304-3975(92)90322-7_BIB39","series-title":"SEKI Report SR-87-14","first-page":"297","article-title":"Order-sorted equational computation","author":"Smolka","year":"1987"},{"key":"10.1016\/0304-3975(92)90322-7_BIB40","series-title":"The Second Internat. Workshop on Conditional and Typed Rewrite System","first-page":"208","article-title":"Order sorted theories as monads: A term rewriting viewpoint (extended abstract)","author":"Stell","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB41","series-title":"Extended Abstracts of the 3rd Internat. Workshop on Unification","first-page":"106","article-title":"Unitary unification in order-sorted signatures (extended abstract)","author":"Waldmann","year":"1989"},{"key":"10.1016\/0304-3975(92)90322-7_BIB42","series-title":"The Second Internat. Workshop on Conditional and Typed Rewrite Systems","first-page":"198","article-title":"Compatibility of order-sorted rewrite rules","author":"Waldmann","year":"1990"},{"key":"10.1016\/0304-3975(92)90322-7_BIB43","first-page":"882","article-title":"A many-sorted calculus based on resolution and paramodulation","author":"Walther","year":"1983","journal-title":"Proc. of the 8th Internat. Joint Conf. Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90322-7_BIB44","series-title":"Tech. Report CSD-TR-606","article-title":"Least sorts of order-sorted term rewriting","author":"Watson","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903227?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903227?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:57:10Z","timestamp":1555127830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592903227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0304397592903227"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90322-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}