{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:28Z","timestamp":1725456988320},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032066","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"674-688","source":"Crossref","is-referenced-by-count":22,"title":["Equational formulas in order-sorted algebras"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Comon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Research Report","volume-title":"A logic of semi-functions, inclusion and equality. The setting","author":"Aristide","year":"1989","unstructured":"Aristide. A logic of semi-functions, inclusion and equality. The setting. Research Report 89-R-058, Centre de Recherche en Informatique, Nancy, France, 1989."},{"key":"50_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Hubert Comon and Pierre Lescanne. Equational problems and disunification. J. Symbolic Computation, 7:371\u2013425, 1989.","journal-title":"J. Symbolic Computation"},{"key":"50_CR3","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In FGCS'84 Proceedings, pages 85\u201399, November 1984."},{"key":"50_CR4","volume-title":"Unification et Disunification: Th\u00e9orie et Applications","author":"H. Comon","year":"1988","unstructured":"Hubert Comon. Unification et Disunification: Th\u00e9orie et Applications. Th\u00e8se de Doctorat, I.N.P. de Grenoble, France, 1988."},{"key":"50_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-51081-8_101","volume":"355","author":"H. Comon","year":"1989","unstructured":"Hubert Comon. Inductive proofs by specifications transformation. In Proc. Rewriting Techniques and Applications 89, Chapel Hill, LNCS 355, pages 76\u201391, Springer-Verlag, April 1989.","journal-title":"Proc. Rewriting Techniques and Applications 89, Chapel Hill, LNCS"},{"key":"50_CR6","unstructured":"Hubert Comon. Computational Logic: Essays in Honor of Alan Robinson, chapter Disunification: a Survey. MIT Press, 1990. (to appear)."},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Handbook of Theoretical Computer Science, chapter Rewrite Systems. Volume B, North-Holland, 1990. (to appear).","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, Jean-Pierre Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. 12th ACM Symp. Principles of Programming Languages, New Orleans, 1985.","DOI":"10.1145\/318593.318610"},{"key":"50_CR9","unstructured":"J. Goguen, Jean-Pierre Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, Proc. 12th ICALP, Nafplion, LNCS 194, Springer-Verlag, July 1985."},{"key":"50_CR10","unstructured":"J. Goguen and J. Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operators, Errors and Inheritance. Draft, Computer Science Lab., SRI International, 1987."},{"key":"50_CR11","unstructured":"J. Goguen and J. Meseguer. Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems. In Proc. 2nd IEEE Symp. Logic in Computer Science, Ithaca, NY, June 1987."},{"key":"50_CR12","unstructured":"Jean-Pierre Jouannaud and E. Kounalis. Automatic proofs by induction in equational theories without constructors. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass., June 1986."},{"key":"50_CR13","unstructured":"Claude Kirchner. Order-sorted equational unification. In Proc. 5th Int. Conference on Logic Programming, Seattle, August 1988."},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Claude Kirchner, H\u00e9l\u00e8ne Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In Proc. 15th ICALP, Tampere, LNCS 317, Springer-Verlag, July 1988.","DOI":"10.1007\/3-540-19488-6_123"},{"key":"50_CR15","unstructured":"D. Kapur, P. Narendran, D.J. Rosenkrantz, and H. Zhang. Sufficient Completeness, Quasi-Reducibility and their Complexity. Research Report TR 87-26, Computer Science Department, State University of New York at Albany, 1987."},{"key":"50_CR16","unstructured":"D. Kapur, P. Narendran, and H. Zhang. On Sufficient Completeness and Related Properties of Term Rewriting Systems. Research Report, General Electric Company, October 1985. Preprint."},{"key":"50_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen. Negation in logic programming. J. Logic Programming, 4:289\u2013308, 1987.","journal-title":"J. Logic Programming"},{"key":"50_CR18","unstructured":"J.-L. Lassez, M. J. Maher, and K. G. Marriot. Unification revisited. In Proc. Workshop on Found. of Logic and Functional Programming, Trento, LNCS 306, Springer-Verlag, December 1986."},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, pages 348\u2013357, July 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"A. I. Mal'cev. Axiomatizable classes of locally free algebras of various types. In The Metamathematics of Algebraic Systems. Collected Papers. 1936\u20131967, pages 262\u2013289, North-Holland, 1971.","DOI":"10.1016\/S0049-237X(08)70560-3"},{"key":"50_CR21","unstructured":"M. Mehl. Gleichungsdefinierte Probleme. L\u00f6sungsmethoden und Anwendungen bei algebraischen Spezifikationen. Projektarbeit, Universit\u00e4t Kaiserslautern, 1988. In german."},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"P.D. Mosses. Unified algebras and institutions. In Proc. 4th IEEE Symp. Logic in Computer Science, June 1989.","DOI":"10.1109\/LICS.1989.39185"},{"key":"50_CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. Plaisted","year":"1985","unstructured":"D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182\u2013215, 1985.","journal-title":"Information and Control"},{"key":"50_CR24","unstructured":"G. Smolka. Order-Sorted Horn Logic: Semantics and Deduction. Research Report SR-86-17, Univ. Kaiserslautern, October 1986."},{"key":"50_CR25","doi-asserted-by":"crossref","unstructured":"G. Smolka. Logic programming over polymorphically order-sorted types. PhD thesis, Univ. Kaiserslautern, May 1989.","DOI":"10.1007\/3-540-50667-5_58"},{"key":"50_CR26","unstructured":"G. Smolka, W. Nutt, J. Goguen, and J. Meseguer. Order-Sorted Equational Computation. SEKI Report SR-87-14, Univ. Kaiserslautern, December 1987."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:33Z","timestamp":1586612733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0032066","relation":{},"subject":[]}}