{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:10:28Z","timestamp":1725466228294},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646754"},{"type":"electronic","value":"9783540691105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054263","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:28:51Z","timestamp":1149650931000},"page":"239-253","source":"Crossref","is-referenced-by-count":2,"title":["A fast algorithm for uniform semi-unification"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Oliart","sequence":"first","affiliation":[]},{"given":"Wayne","family":"Snyder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"24_CR1","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983."},{"key":"24_CR2","unstructured":"F. Baader and W. Snyder. Unification theory. In Handbook on Automated Deduction. Springer. To be published."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"24_CR4","first-page":"909","volume":"83","author":"J. Corbin","year":"1993","unstructured":"J. Corbin and M. Bidoit. A rehabilitation of robinson's unification algorithm. Information Processing, 83:909\u2013914, 1993.","journal-title":"Information Processing"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"F. Henglein. Type inference and semi-unification. In ACM Conference on Lisp and Functional Programming, pages 184\u2013197. ACM, 1988.","DOI":"10.1145\/62678.62701"},{"key":"24_CR6","series-title":"NYU Technical Report 443","volume-title":"PhD thesis, Rutgers University, April 1989","author":"F. Henglein","year":"1989","unstructured":"Fritz Henglein. Polymorphic Type Inference and Semi-Unification. PhD thesis, Rutgers University, April 1989. Available as NYU Technical Report 443, May 1989, from New York University, Courant Institute of Mathematical Sciences, Department of Computer Science, 251 Mercer St., New York, N.Y. 10012, USA."},{"key":"24_CR7","unstructured":"G. Huet. R\u00e9solution d'Equations dans les Langages d'Ordre 1,2,...,\u03a9. PhD thesis, Universit\u00e9 de Paris VII, 1976."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(91)90189-9","volume":"81","author":"D. Kapur","year":"1991","unstructured":"D. Kapur, D. Musser, P. Narendran, and Stillman J. Semi-unification. Theoretical Computer Science, 81(2):169\u2013188, April 1991.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/inco.1993.1003","volume":"102","author":"A.J. Kfoury","year":"1993","unstructured":"A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Information and Computation, 102(1):83\u2013101, January 1993.","journal-title":"Information and Computation"},{"key":"24_CR10","unstructured":"D.S. Lankford and D.R. Musser. A finite termination criterion. Unpublished Draft, USC Information Sciences Institute, 1978."},{"key":"24_CR11","volume-title":"Technical Report INF-2-ASE-5-89","author":"H. Leiss","year":"1989","unstructured":"H. Leiss. Semi-unification and type inference for polymorphic recursion. Technical Report INF-2-ASE-5-89, Siemens, Munich, Germany, 1989."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"A. Oliart and W. Snyder. Fast algorithms for semi-unification. http:\/\/www.cs.bu.edu\/faculty\/snyder\/pubs.html, 1998.","DOI":"10.1007\/BFb0054263"},{"key":"24_CR13","unstructured":"P. Pudlack. On a unification problem related to kreisel's conjecture. Commentationes Mathematicae Universitatis Carolinae, 1988. Praguec Czechoslovakia."},{"key":"24_CR14","first-page":"54","volume-title":"volume 250 of Lecture Notes in Computer Science","author":"P.W. Purdom","year":"1987","unstructured":"P.W. Purdom. Detecting looping simplifications. In Proc. 2nd Conference on Rewrite Rule Theory and Applications, volume 250 of Lecture Notes in Computer Science, pages 54\u201362. Springer, Berlin, May 1987."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"P. Ruzicka. An efficient decision algorithm for the uniform semi-unification problem. In 16th International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer, September 1991.","DOI":"10.1007\/3-540-54345-7_85"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-15"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:45:43Z","timestamp":1555641943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646754","9783540691105"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0054263","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}