{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T22:07:17Z","timestamp":1657577237213},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0304-3975(93)90075-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"273-298","source":"Crossref","is-referenced-by-count":14,"title":["Higher-order unification via combinators"],"prefix":"10.1016","volume":"114","author":[{"given":"Daniel J.","family":"Dougherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90075-5_BIB1","series-title":"Extended Abstracts, Second Internat. Workshop on Conditional and Typed Rewriting Systems","first-page":"149","article-title":"Adding algebraic rewriting to the calculus of constructions: strong normalization preserved","author":"Barbanera","year":"1990"},{"key":"10.1016\/0304-3975(93)90075-5_BIB2","series-title":"Proc. 3rd Ann. Symp. on Logic in Computer Science","first-page":"82","article-title":"Combining algebra and higher-order types","author":"Breazu-Tannen","year":"1988"},{"key":"10.1016\/0304-3975(93)90075-5_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(91)90037-3","article-title":"Polymorphic rewriting conserves algebraic strong normalization and confluence","volume":"83","author":"Breazu-Tannen","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90075-5_BIB4","volume":"Vol. I","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(93)90075-5_BIB5","volume":"Vol. II","author":"Curry","year":"1972"},{"key":"10.1016\/0304-3975(93)90075-5_BIB6_1","series-title":"Proc. 4th Internat. Conf. on Rewriting Techniques and Applications","first-page":"37","article-title":"Adding algebra to the untyped lambda calculus","volume":"Vol. 488","author":"Dougherty","year":"1991"},{"key":"10.1016\/0304-3975(93)90075-5_BIB6_2","unstructured":"Inform. and Comput. to appear."},{"key":"10.1016\/0304-3975(93)90075-5_BIB7_1","series-title":"Proc. 10th Conf. on Automated Deduction","first-page":"261","article-title":"An improved general E-unification method","volume":"Vol. 449","author":"Dougherty","year":"1990"},{"key":"10.1016\/0304-3975(93)90075-5_BIB7_2","unstructured":"J. Symbolic Comput., to appear."},{"key":"10.1016\/0304-3975(93)90075-5_BIB8","series-title":"Proc. 10th Conf. on Automated Deduction","first-page":"121","article-title":"Higher-order unification with dependent function types","volume":"Vol. 355","author":"Elliott","year":"1989"},{"key":"10.1016\/0304-3975(93)90075-5_BIB9","first-page":"161","article-title":"First-order unification in an equational theory","author":"Fay","year":"1979","journal-title":"Proc. 4th Workshop on Automated Deduction"},{"issue":"2, 3","key":"10.1016\/0304-3975(93)90075-5_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","article-title":"Complete sets of transformations for general E-unification","volume":"67","author":"Gallier","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"1 & 2","key":"10.1016\/0304-3975(93)90075-5_BIB11","first-page":"101","article-title":"Higher-order unification revisited: complete sets of transformations","volume":"8","author":"Gallier","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(93)90075-5_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"The undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90075-5_BIB13","first-page":"29","article-title":"The principal type-scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90075-5_BIB14","first-page":"808","article-title":"A short proof of Curry's normal form theorem","volume":"24","author":"Hindley","year":"1970","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90075-5_BIB15","series-title":"Introduction to Combinators and \u03bb-Calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0304-3975(93)90075-5_BIB16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(73)90301-X","article-title":"The undecidability of unification in third-order logic","volume":"22","author":"Huet","year":"1973","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90075-5_BIB17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90075-5_BIB18","series-title":"Th\u00e8se d'Etat","article-title":"R\u00e9solution d'equations dans les langages d'ordre 1, 2, \u2026, \u03c9","author":"Huet","year":"1976"},{"key":"10.1016\/0304-3975(93)90075-5_BIB19","first-page":"1","article-title":"Super-Combinators","author":"Hughes","year":"1982","journal-title":"Proc. ACM Conf. on LISP and Functional Programming"},{"key":"10.1016\/0304-3975(93)90075-5_BIB20","series-title":"Dissertation","article-title":"The design and implementation of programming languages","author":"Hughes","year":"1984"},{"key":"10.1016\/0304-3975(93)90075-5_BIB21","series-title":"Report CS-73-16","article-title":"Mechanizing \u03c9-order type theory through unification","author":"Jensen","year":"1973"},{"key":"10.1016\/0304-3975(93)90075-5_BIB22","series-title":"Dissertation","article-title":"Complete sets of transformations for unification problems","author":"Johann","year":"1991"},{"key":"10.1016\/0304-3975(93)90075-5_BIB23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.2307\/2271659","article-title":"Strong reduction and normal form in combinatory logic","volume":"2","author":"Lecher","year":"1967","journal-title":"Symbolic Logic"},{"issue":"2","key":"10.1016\/0304-3975(93)90075-5_BIB24","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Prog. Languages Systems"},{"key":"10.1016\/0304-3975(93)90075-5_BIB25","series-title":"Dissertation","article-title":"A higher-order logic as the basis for logic programming","author":"Nadathur","year":"1987"},{"key":"10.1016\/0304-3975(93)90075-5_BIB26","series-title":"Extended Abstracts, Second Internat. Workshop on Conditional and Typed Rewriting Systems","first-page":"229","article-title":"Higher-order unification, polymorphism, and subsorts","author":"Nipkow","year":"1990"},{"key":"10.1016\/0304-3975(93)90075-5_BIB27","series-title":"Logic and Computer Science","article-title":"Isabelle: The next 700 theorem provers","author":"Paulson","year":"1990"},{"key":"10.1016\/0304-3975(93)90075-5_BIB28","series-title":"The Implementation of Functional Programming Languages","author":"Peyton-Jones","year":"1987"},{"issue":"2","key":"10.1016\/0304-3975(93)90075-5_BIB29","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/321752.321764","article-title":"A complete mechanization of second-order logic","volume":"20","author":"Pietzykowski","year":"1971","journal-title":"ACM J."},{"key":"10.1016\/0304-3975(93)90075-5_BIB30","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-17220-3_20","article-title":"Improving basic narrowing techniques","author":"R\u00e9ty","year":"1987","journal-title":"Proc. 2nd Internat. Conf. on Rewriting Techniques and Applications"},{"key":"10.1016\/0304-3975(93)90075-5_BIB31","first-page":"212","article-title":"Norma: a graph reduction processor","author":"Scheevel","year":"1986","journal-title":"Proc. ACM Conf. on LISP and Functional Programming"},{"key":"10.1016\/0304-3975(93)90075-5_BIB32","series-title":"Proc. 10th Conf. on Automated Deduction","first-page":"573","article-title":"Higher-order E-unification","author":"Snyder","year":"1990"},{"key":"10.1016\/0304-3975(93)90075-5_BIB33","first-page":"378","article-title":"On translating lambda terms into combinators: the basis problem","author":"Statman","year":"1986","journal-title":"Proc. Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90075-5_BIB34","series-title":"Dissertation","article-title":"The implementation of functional languages using custom hardware","author":"Stoye","year":"1985"},{"key":"10.1016\/0304-3975(93)90075-5_BIB35","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software Practice and Experience"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900755?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900755?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:12Z","timestamp":1555129392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0304397593900755"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90075-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}