{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:51:12Z","timestamp":1778950272466,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0167-6423(92)90038-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"281-313","source":"Crossref","is-referenced-by-count":22,"title":["A bottom-up polymorphic type inference in logic programming"],"prefix":"10.1016","volume":"19","author":[{"given":"Roberto","family":"Barbuti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(92)90038-D_BIB1","series-title":"Abstract Interpretation of Declarative Languages","first-page":"9","article-title":"An introduction to abstract interpretation","author":"Abramsky","year":"1987"},{"key":"10.1016\/0167-6423(92)90038-D_BIB2","series-title":"Proceedings of the Third Italian Conference on Theoretical Computer Science","first-page":"84","article-title":"A declarative abstract semantics for logic programs","author":"Barbuti","year":"1989"},{"key":"10.1016\/0167-6423(92)90038-D_BIB3","series-title":"Tech. Report TR 12\/91","article-title":"A general framework for semantics-based bottom-up abstract interpretation of logic programs","author":"Barbuti","year":"1991"},{"key":"10.1016\/0167-6423(92)90038-D_BIB4","series-title":"Tech. Report TR 17\/91","first-page":"570","article-title":"Contributions to the semantics of open logic programs","author":"Bossi","year":"1991"},{"key":"10.1016\/0167-6423(92)90038-D_BIB5","series-title":"Proceedings Fifth International Conference on Logic Programming","first-page":"669","article-title":"An instance of abstract interpretation integrating type and mode inferencing","author":"Bruynooghe","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB6","series-title":"Proceedings Fourth IEEE International Symposium on Logic Programming","first-page":"192","article-title":"Abstract interpretation: towards the global optimization of Prolog programs","author":"Bruynooghe","year":"1987"},{"key":"10.1016\/0167-6423(92)90038-D_BIB7","series-title":"Tech. Report","article-title":"Bottom-up abstract interpretation of logic programs","author":"Codish","year":"1990"},{"key":"10.1016\/0167-6423(92)90038-D_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/158511.158703","article-title":"Compositional analysis of modular logic programs","author":"Codish","year":"1993","journal-title":"Proceedings Twentieth ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(92)90038-D_BIB9","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977","journal-title":"Proceedings Fourth ACM Symposium Principles of Programming Languages,"},{"key":"10.1016\/0167-6423(92)90038-D_BIB10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/567752.567778","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979","journal-title":"Proceedings Sixth ACM Symposium Principles of Programming Languages"},{"key":"10.1016\/0167-6423(92)90038-D_BIB11","series-title":"Proceedings Fifth International Conference on Logic Programming","first-page":"993","article-title":"A new declarative semantics for logic languages","author":"Falaschi","year":"1988"},{"issue":"3","key":"10.1016\/0167-6423(92)90038-D_BIB12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(92)90038-D_BIB13","series-title":"Tech. Report TR 32\/89","article-title":"A model-theoretic reconstruction of the operational semantics of logic programs","author":"Falaschi","year":"1989"},{"key":"10.1016\/0167-6423(92)90038-D_BIB14","series-title":"Automata, Languages and Programming, 18th International Colloquium","first-page":"1","article-title":"On the semantics of logic programs","volume":"510","author":"Gabbrielli","year":"1991"},{"key":"10.1016\/0167-6423(92)90038-D_BIB15","first-page":"355","article-title":"An efficient type system for Prolog","author":"Gang","year":"1986","journal-title":"Proceedings IFIP Congress 86"},{"key":"10.1016\/0167-6423(92)90038-D_BIB16","series-title":"Proceedings Seventh International Conference on Logic Programming","first-page":"291","article-title":"Pipeline optimizations in AND-parallelism by abstract interpretation","author":"Giacobazzi","year":"1990"},{"key":"10.1016\/0167-6423(92)90038-D_BIB17","series-title":"Proceedings TAPSOFT 89","article-title":"Horn clause programs with polymorphic types: semantics and resolution","volume":"351","author":"Hanus","year":"1989"},{"key":"10.1016\/0167-6423(92)90038-D_BIB18","series-title":"Tech. Report","article-title":"Computation-oriented reduction of predicate to propositional logic","author":"Jeroslow","year":"1985"},{"key":"10.1016\/0167-6423(92)90038-D_BIB19","series-title":"Logic Programming 87\u2014Tokyo","first-page":"195","article-title":"Polymorphic type inference in Prolog by abstract interpretation","volume":"315","author":"Kanomori","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB20","series-title":"Proceedings North American Conference on Logic Programming '90","first-page":"506","article-title":"An algebraic framework for the abstract interpretation of logic programs","author":"Kemp","year":"1990"},{"key":"10.1016\/0167-6423(92)90038-D_BIB21","series-title":"Proceedings Fourth International Conference on Logic Programming","first-page":"788","article-title":"Type synthesis for Ground Prolog","author":"Klu\u017aniak","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB22","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification revisited","author":"Lassez","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB23","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/567067.567077","article-title":"Polymorphic type inference","author":"Leivant","year":"1983","journal-title":"Proceedings Tenth ACM Symposium Principles of Programming Languages"},{"key":"10.1016\/0167-6423(92)90038-D_BIB24","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0167-6423(92)90038-D_BIB25","series-title":"Proceedings Fifth International Conference on Logic Programming","first-page":"733","article-title":"Bottom-up abstract interpretation of logic programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB26","series-title":"Tech. Report 12","article-title":"On describing success patterns of logic programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB27","series-title":"Category Theory and Computer Programming","first-page":"299","article-title":"Galois connections and computer science applications","volume":"240","author":"Melton","year":"1986"},{"issue":"3","key":"10.1016\/0167-6423(92)90038-D_BIB28","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0167-6423(92)90038-D_BIB29","first-page":"289","article-title":"Towards a theory of types in Prolog","author":"Mishra","year":"1984","journal-title":"Proceedings 1st IEEE Symposium on Logic Programming"},{"key":"10.1016\/0167-6423(92)90038-D_BIB30","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\/0167-6423(92)90038-D_BIB31","series-title":"Proceedings North American Conference on Logic Programming '89","first-page":"1115","article-title":"Inference of polymorphic types for logic programming","author":"Pyo","year":"1989"},{"key":"10.1016\/0167-6423(92)90038-D_BIB32","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of success patterns in logic programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0167-6423(92)90038-D_BIB33","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\/0167-6423(92)90038-D_BIB34","series-title":"Proceedings Fifth International Conference on Logic Programming","first-page":"604","article-title":"A type inference system for Prolog","author":"Xu","year":"1988"},{"key":"10.1016\/0167-6423(92)90038-D_BIB35","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","article-title":"A type system for logic programs","volume":"10","author":"Yardeni","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0167-6423(92)90038-D_BIB36","series-title":"Proceedings Fourth International Conference on Logic Programming","article-title":"Derivation of polymorphic types for Prolog programs","author":"Zobel","year":"1988"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290038D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290038D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T19:14:20Z","timestamp":1681845260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239290038D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["016764239290038D"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(92)90038-d","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}