{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:59Z","timestamp":1725664079884},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575290"},{"type":"electronic","value":"9783540482116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57529-4_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:05:18Z","timestamp":1330261518000},"page":"139-150","source":"Crossref","is-referenced-by-count":2,"title":["Higher-order and semantic unification"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subrata","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen. Combining Algebra and Higher-order Types. In Proc. of the Third Annual IEEE Symposium on Logic in Computer Science, pages 82\u201390, 1988.","DOI":"10.1109\/LICS.1988.5103"},{"key":"11_CR2","first-page":"112","volume-title":"Narrowing Directed by a Graph of Terms","author":"J. Chabin","year":"1990","unstructured":"J. Chabin and P. R\u00e9ty. Narrowing Directed by a Graph of Terms. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 112\u2013123, of Lecture Notes in Computer Science, Springer Verlag, 1990."},{"key":"11_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 243\u2013320, North-Holland, Amsterdam, 1990."},{"key":"11_CR4","first-page":"283","volume-title":"Equation Solving in Conditional AC-Theories","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz, Subrata Mitra and G. Sivakumar. Equation Solving in Conditional AC-Theories. In Proceedings of the Second International Conference on Algebraic and Logic Programming, Nancy, France, October 1990. Vol. 463, pages 283\u2013297, of Lecture Notes in Computer Science, Springer Verlag (1990)."},{"key":"11_CR5","first-page":"589","volume-title":"Lecture Notes in Artificial Intelligence","author":"N. Dershowitz","year":"1992","unstructured":"Nachum Dershowitz, Subrata Mitra, and G. Sivakumar. Decidable matching for convergent systems. In Proceedings of the Eleventh Conference on Automated Deduction, pages 589\u2013602, Saratoga Springs, NY, June 1992. Vol. 607 of Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin."},{"key":"11_CR6","first-page":"45","volume-title":"Lecture Notes in Computer Science","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz and G. Sivakumar. Solving Goals in Equational Languages. In Proceedings of the First International Workshop Conditional Term Rewriting System, Orsay, France, July 1987. Vol. 308, pages 45\u201355, of Lecture Notes in Computer Science, Springer Verlag (1987)."},{"key":"11_CR7","first-page":"37","volume-title":"Lecture Notes in Computer Science","author":"D. J. Dougherty","year":"1990","unstructured":"D. J. Dougherty. Adding Algebra to the Untyped Lambda Calculus. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 37\u201348, of Lecture Notes in Computer Science, Springer Verlag, 1990."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"D. J. Dougherty. Higher-order unification via combinators. Theoretical Computer Science 114, pages 273\u2013298.","DOI":"10.1016\/0304-3975(93)90075-5"},{"key":"11_CR9","first-page":"79","volume-title":"Lecture Notes in Computer Science","author":"D. J. Dougherty","year":"1992","unstructured":"Daniel J. Dougherty and Patricia Johann. A Combinatory Logic Approach to Higher-order E-unification. In Proc. of the Eleventh Conference on Automated Deduction, Saratoga Springs, New York, June, 1992. Vol. 607, pages 79\u201393, of Lecture Notes in Computer Science, Springer Verlag, 1992."},{"key":"11_CR10","first-page":"318","volume-title":"Lecture Notes in Computer Science","author":"H. Jean-Marie","year":"1980","unstructured":"Jean-Marie Hullot. Canonical forms and unification. In R. Kowalski, editor, Proc. of the Fifth International Conference on Automated Deduction, pages 318\u2013334, Les Arcs, France, July 1980. Vol. 87 of Lecture Notes in Computer Science, Springer, Berlin."},{"key":"11_CR11","first-page":"200","volume-title":"of Lecture Notes in Computer Science","author":"T. Nipkow","year":"1990","unstructured":"T. Nipkow and Z. Qian. Modular Higher-order E-Unification. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 200\u2013214, of Lecture Notes in Computer Science, Springer Verlag, 1990."},{"key":"11_CR12","first-page":"228","volume-title":"Improving Basic Narrowing Techniques","author":"P. R\u00e9ty","year":"1987","unstructured":"Pierre R\u00e9ty. Improving Basic Narrowing Techniques. In P. Lescanne,. editor, Proc. of the Second International Conference on Rewriting Techniques and Applications, pages 228\u2013241, Bordeaux, France, May 1987. Vol. 256 of Lecture Notes in Computer Science, Springer, Berlin."},{"key":"11_CR13","first-page":"573","volume-title":"Lecture Notes in Computer Science","author":"W. Snyder","year":"1990","unstructured":"Wayne Snyder. Higher Order E-Unification. In Proceedings of the Tenth Int. Conference on Automated Deduction, Kaiserslautern, FRG, July 1990. Vol. 449, pages 573\u2013587, of Lecture Notes in Computer Science, Springer Verlag, 1990."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57529-4_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:43Z","timestamp":1605647563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57529-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575290","9783540482116"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57529-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}