{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T02:10:02Z","timestamp":1736129402830,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029593","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"15-25","source":"Crossref","is-referenced-by-count":3,"title":["Syntactic theories"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Jouannaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Unification et Disunification: Th\u00e9orie et Applications","author":"H. Comon","year":"1988","unstructured":"H. Comon. Unification et Disunification: Th\u00e9orie et Applications. Th\u00e8se de Doctorat, I.N.P. de Grenoble, France, 1988."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. 1989. To appear in the Handbook of Theoretical Computer Science.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"2_CR3","unstructured":"E. Diday and Y. Kodratoff. 2\u00e8mes journ\u00e9es symbolique num\u00e9rique pour l'apprentissage de connaissances \u00e0 partir de donn\u00e9es. Research Report, LRI, June 1989."},{"key":"2_CR4","unstructured":"M. Fay. First order unification in equational theories. In Proc. 4th Conf. on Automated Deduction, Austin, LNCS, July 1979."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"J. Herbrand. Recherches sur la th\u00e9orie de la d\u00e9monstration. Th\u00e8se d'Etat, Univ. Paris, 1930. Also in: Ecrits logiques de Jacques Herbrand, PUF, Paris, 1968.","DOI":"10.3917\/puf.herbr.1968.01.0233"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"H. Hsiang and M. Rusinowitch. On word problems in equational theories. In Proc. 14th ICALP, Karlsruhe, LNCS 267, Springer-Verlag, July 1987. Available as INRIA Research Report 678.","DOI":"10.1007\/3-540-18088-5_6"},{"key":"2_CR7","unstructured":"J.-P. Jouannaud and C. Kirchner. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. To appear in Festschrift for Robinson, JL. Lassez and G. Pl\u00f6tkin ed., MIT press, 1990."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and Y. Kodratoff. Program synthesis from examples of behaviour. In A. W. Bierman and G. Guiho, editors, Computer Program Synthesis Methodologies, D. Reidel, 1983.","DOI":"10.1007\/978-94-009-7019-9_7"},{"key":"2_CR9","volume-title":"M\u00e9thodes et Outils de Conception Syst\u00e9matique d'Algorithmes d'Unification dans les Th\u00e9ories equationnelles","author":"C. Kirchner","year":"1985","unstructured":"C. Kirchner. M\u00e9thodes et Outils de Conception Syst\u00e9matique d'Algorithmes d'Unification dans les Th\u00e9ories equationnelles. Th\u00e8se d'Etat, Univ. Nancy, France, 1985."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"C. Kirchner and F. Klay. Syntactic theories and unification. In Proc. 5th IEEE Symposium on Logic in Computer Science, Philadelphia, June 1990.","DOI":"10.1109\/LICS.1990.113753"},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"T. Nipkov. Proof transformations for equational theories. In Proc. 5rth IEEE Symp. Logic in Computer Science, June 1990.","DOI":"10.1109\/LICS.1990.113754"},{"key":"2_CR13","unstructured":"D. R\u00e9my. Alg\u00e8bres touffues. Application au typage polymorphe des objets enregistrements dans les langage fonctionnels. Th\u00e8se de Doctorat, Universit\u00e9 Paris 7, France, 1990."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:34:20Z","timestamp":1736127260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029593","relation":{},"subject":[]}}