{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:58:25Z","timestamp":1649037505924},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0096-0551(94)90012-4","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"25-42","source":"Crossref","is-referenced-by-count":5,"title":["Implementing polymorphic typing in a logic programming language"],"prefix":"10.1016","volume":"20","author":[{"given":"Keehang","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Gopalan","family":"Nadathur","sequence":"additional","affiliation":[]},{"given":"Debra Sue","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(94)90012-4_BIB1","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","article-title":"Notions of polymorphism for predicate logic programs","author":"Reddy","year":"1988"},{"key":"10.1016\/0096-0551(94)90012-4_BIB2","series-title":"Fifth International Logic Programming Conference","first-page":"810","article-title":"An overview of \u03bb Prolog","author":"Nadathur","year":"1988"},{"key":"10.1016\/0096-0551(94)90012-4_BIB3","series-title":"Types in Logic Programming","first-page":"245","article-title":"The type system of a higher-order logic programming language","author":"Nadathur","year":"1992"},{"key":"10.1016\/0096-0551(94)90012-4_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00993253","article-title":"Higher-order and modal logic as a framework for explanation-based generalization","volume":"9","author":"Dietzen","year":"1992","journal-title":"Mach. Learn."},{"key":"10.1016\/0096-0551(94)90012-4_BIB5","article-title":"Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language","author":"Felty","year":"1989"},{"key":"10.1016\/0096-0551(94)90012-4_BIB6","article-title":"Investigating a Proof-theoretic Meta-language for Functional Programs","author":"Hannan","year":"1990"},{"key":"10.1016\/0096-0551(94)90012-4_BIB7","series-title":"IEEE Symposium on Logic Programming","first-page":"379","article-title":"A logic programming approach to manipulating formulas and programs","author":"Miller","year":"1987"},{"key":"10.1016\/0096-0551(94)90012-4_BIB8","series-title":"Proceedings of the ACM Lisp and Functional Programming Conference","first-page":"153","article-title":"Partial polymorphic type inference and higher-order unification","author":"Pfenning","year":"1988"},{"key":"10.1016\/0096-0551(94)90012-4_BIB9","series-title":"Eighth International Logic Programming Conference","first-page":"871","article-title":"Implementation techniques for scoping constructs in logic programming","author":"Jayaraman","year":"1991"},{"key":"10.1016\/0096-0551(94)90012-4_BIB10","series-title":"Proceedings of the North American Conference on Logic Programming","first-page":"1180","article-title":"Towards a WAM model for \u03bb Prolog","author":"Nadathur","year":"1989"},{"key":"10.1016\/0096-0551(94)90012-4_BIB11","article-title":"Scoping constructs in logic programming: implementation problems and their solution","author":"Nadathur","year":"1993"},{"key":"10.1016\/0096-0551(94)90012-4_BIB12","article-title":"Implementation considerations for higher-order features in logic programming","author":"Nadathur","year":"1993"},{"key":"10.1016\/0096-0551(94)90012-4_BIB13","series-title":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming","first-page":"341","article-title":"A representation of lambda terms suitable for operations on their intensions","author":"Nadathur","year":"1990"},{"key":"10.1016\/0096-0551(94)90012-4_BIB14","series-title":"Proceedings of the Workshop on the \u03bbProlog Programming Language","article-title":"An instruction set for higher-order hereditary Harrop formulas","author":"Kwon","year":"1992"},{"key":"10.1016\/0096-0551(94)90012-4_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50940-2_38","article-title":"Horn clause programs with polymorphic types: semantics and resolution","author":"Hanus","year":"1989"},{"key":"10.1016\/0096-0551(94)90012-4_BIB16","series-title":"Proceedings of the International Logic Programming Symposium","first-page":"202","article-title":"Typed Prolog: a semantic reconstruction of the Mycroft-O'Keefe type system","author":"Lakshman","year":"1991"},{"key":"10.1016\/0096-0551(94)90012-4_BIB17","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":"Artific. Intell."},{"key":"10.1016\/0096-0551(94)90012-4_BIB18","article-title":"TEL (Version 0.9), report and users manual","author":"Smolka","year":"1988"},{"key":"10.1016\/0096-0551(94)90012-4_BIB19","series-title":"Proceedings of the International Logic Programming Symposium","first-page":"272","article-title":"Extending the Warren abstract machine to polymorphic order-sorted resolution","author":"Beierle","year":"1991"},{"key":"10.1016\/0096-0551(94)90012-4_BIB20","series-title":"Proceedings of the Sixth International Logic Programming Conference","first-page":"382","article-title":"Polymorphic higher-order programming in Prolog","author":"Hanus","year":"1989"},{"key":"10.1016\/0096-0551(94)90012-4_BIB21","series-title":"Technical report","article-title":"An abstract Prolog instruction set","author":"Warren","year":"1983"},{"issue":"4","key":"10.1016\/0096-0551(94)90012-4_BIB22","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":"Jl ACM"},{"key":"10.1016\/0096-0551(94)90012-4_BIB23","author":"Gordon","year":"1979"},{"key":"10.1016\/0096-0551(94)90012-4_BIB24","series-title":"Warren's Abstract Machine: a Tutorial Reconstruction","author":"A\u00eft Kaci","year":"1991"},{"key":"10.1016\/0096-0551(94)90012-4_BIB25","series-title":"Proceedings of the 1986 Symposium on Logic Programming","first-page":"267","article-title":"Register allocation in a Prolog machine","author":"Debray","year":"1986"},{"key":"10.1016\/0096-0551(94)90012-4_BIB26","article-title":"Implementing logic programming languages with polymorphic typing","author":"Kwon","year":"1991"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:26:37Z","timestamp":1552620397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055194900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0096055194900124"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(94)90012-4","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}