{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:27:45Z","timestamp":1648884465511},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7108,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0743-1066(94)90049-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"123-148","source":"Crossref","is-referenced-by-count":8,"title":["Run-time type computations in the Warren Abstract machine"],"prefix":"10.1016","volume":"18","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[]},{"given":"Gregor","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)90049-3_BIB1","series-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"A\u00eft-Kaci","year":"1991"},{"key":"10.1016\/0743-1066(94)90049-3_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90013-0","article-title":"LOGIN: A logical Programming Language with Built-In Inheritance","volume":"3","author":"A\u00eft-Kaci","year":"1986","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(94)90049-3_BIB3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1147\/rd.363.0375","article-title":"Logic Programming with Typed Unification and Its Realization on an Abstract Machine","volume":"36","author":"Beierle","year":"1992","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/0743-1066(94)90049-3_BIB4","series-title":"Computer Science Logic\u2014CSL'91","article-title":"Correctness Proof for the WAM with Types","author":"Beierle","year":"1992"},{"key":"10.1016\/0743-1066(94)90049-3_BIB5","series-title":"IWBS Report 175","article-title":"Draft Report of the Logic Programming Language PROTOS-L","author":"Beierle","year":"1991"},{"issue":"2\u20133","key":"10.1016\/0743-1066(94)90049-3_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0004-3702(92)90055-3","article-title":"An Order-Sorted Logic for Knowledge Representation Systems","volume":"55","author":"Beierle","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(94)90049-3_BIB7","series-title":"Logic Programming: Proceedings of the 1991 International Symposium","first-page":"272","article-title":"Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution","author":"Beierle","year":"1991"},{"key":"10.1016\/0743-1066(94)90049-3_BIB8","series-title":"TR-14\/92","article-title":"The WAM\u2014Definition and Compiler Correctness","author":"B\u00f6rger","year":"1992"},{"key":"10.1016\/0743-1066(94)90049-3_BIB9","first-page":"207","article-title":"Principal Type-Schemes for Functional Programs","author":"Damas","year":"1982","journal-title":"Proceedings of the 9th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(94)90049-3_BIB10","series-title":"Proceedings of the 2nd European Symposium on Programming","first-page":"79","article-title":"A Polymorphic Type System with Subtypes for Prolog","author":"Dietrich","year":"1988"},{"key":"10.1016\/0743-1066(94)90049-3_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\/0743-1066(94)90049-3_BIB12","article-title":"Evolving Algebras. A Tutorial Introduction","volume":"43","author":"Gurevich","year":"1991","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0743-1066(94)90049-3_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(90)90107-S","article-title":"Horn Clause Programs with Polymorphic Types: Semantics and Resolution","volume":"89","author":"Hanus","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)90049-3_BIB14","series-title":"Proceedings of the Sixth International Conference on Logic Programming","first-page":"382","article-title":"Polymorphic Higher-Order Programming in Prolog","author":"Hanus","year":"1989"},{"key":"10.1016\/0743-1066(94)90049-3_BIB15","series-title":"TR-91-02","article-title":"The G\u00f6del Report","author":"Hill","year":"1992"},{"key":"10.1016\/0743-1066(94)90049-3_BIB16","first-page":"34","article-title":"Extended Prolog for Order-Sorted Resolution","author":"Huber","year":"1987","journal-title":"Proceedings of the 4th IEEE Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(94)90049-3_BIB17","series-title":"Technical Report CS-1991-39","article-title":"Implementing Logic Programming Languages with Polymorphic Typing","author":"Kwon","year":"1991"},{"issue":"2","key":"10.1016\/0743-1066(94)90049-3_BIB18","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 Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(94)90049-3_BIB19","series-title":"Third International Conference on Logic Programming","first-page":"448","article-title":"Higher-Order Logic Programming","author":"Miller","year":"1986"},{"key":"10.1016\/0743-1066(94)90049-3_BIB20","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":"Journal of Computer and System Science"},{"key":"10.1016\/0743-1066(94)90049-3_BIB21","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\/0743-1066(94)90049-3_BIB22","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","first-page":"810","article-title":"An Overview of \u03bbProlog","author":"Nadathur","year":"1988"},{"key":"10.1016\/0743-1066(94)90049-3_BIB23","series-title":"SEKI-Report","article-title":"Implementing TEL","author":"Nutt","year":"1993"},{"key":"10.1016\/0743-1066(94)90049-3_BIB24","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\/0743-1066(94)90049-3_BIB25","series-title":"Diplomarbeit Nr. 583","article-title":"Extension of an Abstract Machine for Order-Sorted Prolog to Polymorphism","author":"Semle","year":"1989"},{"key":"10.1016\/0743-1066(94)90049-3_BIB26","series-title":"Ph.D. dissertation","article-title":"Logic Programming over Polymorphically Order-Sorted Types","author":"Smolka","year":"1989"},{"key":"10.1016\/0743-1066(94)90049-3_BIB27","series-title":"SEKI-Report SR 87-17","article-title":"TEL (Version 0.9), Report and User Manual","author":"Smolka","year":"1988"},{"issue":"1","key":"10.1016\/0743-1066(94)90049-3_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/42267.45071","article-title":"Many-Sorted Unification","volume":"35","author":"Walther","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)90049-3_BIB29","series-title":"Technical Report 309","article-title":"An Abstract PROLOG Instruction Set","author":"Warren","year":"1983"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900493?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:57:46Z","timestamp":1555127866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694900493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0743106694900493"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90049-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}