{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:30:05Z","timestamp":1673127005296},"reference-count":41,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":7960,"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":[[1991,10]]},"DOI":"10.1016\/0304-3975(90)90107-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"63-106","source":"Crossref","is-referenced-by-count":14,"title":["Horn clause programs with polymorphic types: semantics and resolution"],"prefix":"10.1016","volume":"89","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90107-S_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90013-0","article-title":"LOGIN: A logic programming language with built-in inheritance","volume":"3","author":"A\u00eft-Kaci","year":"1986","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/0304-3975(90)90107-S_BIB2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90107-S_BIB3","series-title":"Proc. IFIP '83","first-page":"909","article-title":"A rehabilitation of Robinson's unification algorithm","author":"Bidoit","year":"1983"},{"key":"10.1016\/0304-3975(90)90107-S_BIB4","series-title":"Proc. IEEE Internat. Symp. on Logic Programming","first-page":"89","article-title":"IDEAL: An ideal deductive applicative language","author":"Bosco","year":"1986"},{"key":"10.1016\/0304-3975(90)90107-S_BIB5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(90)90107-S_BIB6","series-title":"Programming in Prolog","author":"Clocksin","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB7","series-title":"Proc. ESOP 88","first-page":"79","article-title":"A polymorphic type system with subtypes for Prolog","volume":"Vol. 300","author":"Dietrich","year":"1988"},{"key":"10.1016\/0304-3975(90)90107-S_BIB8","series-title":"Proc. 9th Ann. Symp. on Principles of Programming Languages","first-page":"207","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/0304-3975(90)90107-S_BIB9","article-title":"Fundamentals of Algebraic Specification 1: Equations and Initial Semantics","volume":"Vol. 6","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(90)90107-S_BIB10","series-title":"Report No. CSLI-84-15","article-title":"Completeness of many-sorted equational logic","author":"Goguen","year":"1984"},{"key":"10.1016\/0304-3975(90)90107-S_BIB11","series-title":"Logic Programming, Functions, Relations, and Equations","first-page":"295","article-title":"Eqlog: Equality, types, and generic modules for logic programming","author":"Goguen","year":"1986"},{"key":"10.1016\/0304-3975(90)90107-S_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(90)90107-S_BIB13","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","volume":"Vol. 4","author":"Goguen","year":"1978"},{"issue":"3","key":"10.1016\/0304-3975(90)90107-S_BIB14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/24697.24709","article-title":"Feature analysis of Turbo Prolog","volume":"22","author":"Hankley","year":"1987","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(90)90107-S_BIB15","series-title":"Proc. Workshop on Programming Language Implementation and Logic Programming","first-page":"273","article-title":"Formal specification of a Prolog compiler","volume":"Vol. 348","author":"Hanus","year":"1988"},{"key":"10.1016\/0304-3975(90)90107-S_BIB16","series-title":"technical report 248","article-title":"Horn clause programs with polymorphic types","author":"Hanus","year":"1988"},{"key":"10.1016\/0304-3975(90)90107-S_BIB17","series-title":"Formal Language Theory: Perspectives and Open Problems","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(90)90107-S_BIB18","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(90)90107-S_BIB19","series-title":"Proc. 4th IEEE Internat. Symp. on Logic Programming","first-page":"34","article-title":"Extended Prolog with order-sorted resolution","author":"Huber","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB20","series-title":"Proc. 14th ACM Symp. on Principles of Programming Languages","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB21","series-title":"Proc. 9th IJCAI","first-page":"704","article-title":"Type inference in Prolog and its application","author":"Kanamori","year":"1985"},{"key":"10.1016\/0304-3975(90)90107-S_BIB22","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"788","article-title":"Type synthesis for ground Prolog","author":"Klu\u017aniak","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB23","article-title":"Compl\u00e9tion de syst\u00e8mes de r\u00e9\u00e9criture types dont les fonctions sont polymorphes (Th\u00e8se de 3\u00e8me cycle)","volume":"VII","author":"Launay","year":"1986"},{"key":"10.1016\/0304-3975(90)90107-S_BIB24","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB25","series-title":"Proc. IEEE Internat. Symp. on Logic Programming","first-page":"289","article-title":"Towards a theory of types in Prolog","author":"Mishra","year":"1984"},{"issue":"2","key":"10.1016\/0304-3975(90)90107-S_BIB26","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. Programming Languages Systems"},{"key":"10.1016\/0304-3975(90)90107-S_BIB27","series-title":"Proc. 3rd Internat. Conf. on Logic Programming","first-page":"448","article-title":"Higher-order logic programming","volume":"Vol. 225","author":"Miller","year":"1986"},{"key":"10.1016\/0304-3975(90)90107-S_BIB28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","article-title":"A polymorphic type system for Prolog","volume":"23","author":"Mycroft","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(90)90107-S_BIB29","unstructured":"A. Mycroft, private communication, 1987."},{"key":"10.1016\/0304-3975(90)90107-S_BIB30","article-title":"Computing in Horn Clause Theories","volume":"Vol. 16","author":"Padawitz","year":"1988"},{"issue":"1\u20133","key":"10.1016\/0304-3975(90)90107-S_BIB31","article-title":"On specifications, theories and models with higher types","volume":"68","author":"Poign\u00e9","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90107-S_BIB32","first-page":"348","article-title":"Linear Unification","volume":"17","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(90)90107-S_BIB33","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90107-S_BIB34","series-title":"SEKI Report SR-86-17","article-title":"Order-sorted Horn logic: semantics and deduction","author":"Smolka","year":"1986"},{"key":"10.1016\/0304-3975(90)90107-S_BIB35","series-title":"SEKI Report SR-87-11","article-title":"TEL (Version 0.9) report and user manual","author":"Smolka","year":"1988"},{"key":"10.1016\/0304-3975(90)90107-S_BIB36","series-title":"Proc. 9th IJCAI","article-title":"A many sorted calculus with polymorphic functions based on resolution and paramodulation","author":"Schmidt-Schauss","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(90)90107-S_BIB37","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90107-S_BIB38","first-page":"441","article-title":"Higher-order extensions to Prolog: are they needed?","volume":"10","author":"Warren","year":"1982"},{"key":"10.1016\/0304-3975(90)90107-S_BIB39","series-title":"Technical Note 309","article-title":"An abstract Prolog instruction set","author":"Warren","year":"1983"},{"key":"10.1016\/0304-3975(90)90107-S_BIB40","series-title":"Technical Report CS87-05","article-title":"A type system for logic programs","author":"Yardeni","year":"1987"},{"key":"10.1016\/0304-3975(90)90107-S_BIB41","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"817","article-title":"Derivation of polymorphic types for Prolog programs","author":"Zobel","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090107S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090107S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:40Z","timestamp":1555127740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090107S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["030439759090107S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90107-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}