{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T05:02:26Z","timestamp":1705035746244},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":5802,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(04)00111-2","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"1-21","source":"Crossref","is-referenced-by-count":0,"title":["A pragmatic type concept for Prolog supporting polymorphism, subtyping, and meta-programming1 1Part of the research reported here was supported by the Deutsche Forschungsgemeinschaft (DFG) under grant Be 1700\/3-1."],"prefix":"10.1016","volume":"30","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[]},{"given":"Reinhold","family":"Kloos","sequence":"additional","affiliation":[]},{"given":"Gregor","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB1","doi-asserted-by":"crossref","unstructured":"A. Aiken and T. K. Lakshman. Directional type checking of logic programs. In Static Analysis Symposium. LNCS. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58485-4_32"},{"issue":"3","key":"10.1016\/S1571-0661(04)00111-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1147\/rd.363.0375","article-title":"Logic programming with typed unification and its realization on abstract machine","volume":"36","author":"Beierle","year":"1992","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB3","doi-asserted-by":"crossref","unstructured":"J. Boye and J. Maluszy\u0144sky. Two aspects of directional types. In L. Sterling, editor, Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, pages 747\u2013761, Tokio, 1995. The MIT Press.","DOI":"10.7551\/mitpress\/4298.003.0071"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB4","unstructured":"F. Bronsard, T. Lakshman, and U. S. Reddy. A framework of directionality for proving termination of logic programs. In K. R. Apt, editor,Logic Programming: Proceedings of 1992 Joint International Conference and Symposium, pages 321\u2013335. The MIT Press, 1992."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB5","doi-asserted-by":"crossref","unstructured":"M. Hanus. parametric order-sorted types in logic programming. In Proc. TAPSOFT'91, volume 494 of LNCS, pages 181\u2013200, Brighton, Apr. 1991. Springer Verlag.","DOI":"10.1007\/3540539816_67"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB6","unstructured":"M. Hanus. Logic programming with type specifications. In Pfenning[16], chapter 3, pages 91\u2013140."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB7","unstructured":"P. Hill and J. Loyd. The G\u00f6del Programming Language. Logic programming series. The MIT Press, 1994."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB8","unstructured":"P. M. Hill and R. W. Topor. A semantics for typed logic programs. In Pfenning[16], chapter 1, pages 1\u201362."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB9","unstructured":"R. Kloos. Extension of type-concept for Prolog for the support of modular software development and meta-programming in AI. Diplomarbeit, FernUniversit\u00e4t Hagen, 1998. (in German)."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB10","unstructured":"T. K. Lakshman and U. S. Reddy. Typed prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. In Saraswat and Ueda, editors, Int. Symp. on Logic Programming, ILPS 91, pages 202\u2013217, San Diego, 1991."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB11","unstructured":"G. Meyer. Type checking and type inferencing for logic programs with subtypes and parametric polymorphism. Informatik Berichte 200, FernUniversit\u00e4t Hagen, June 1996. available via: http:\/\/www.fernuni-hagen.de\/pi8\/typical\/."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB12","unstructured":"G. Meyer. On Types and Type Consistency in Logic Programming. PhD thesis, FernUniversit\u00e4t Hagen, Germany, 1999. (to appear)."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB13","series-title":"Automated Deduction - A Basis for Applications, chapter 10","article-title":"Dimensions of types of logic programming","author":"Meyer","year":"1998"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB14","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"},{"issue":"1","key":"10.1016\/S1571-0661(04)00111-2_NEWBIB15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4299.001.0001","article-title":"Nettalk: Meta-call with call\/N and apply\/3","volume":"10","author":"Naish","year":"1997","journal-title":"Logic Programming Newsletter"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB16","series-title":"Types in Logic Programming, Logic Programming Series","year":"1992"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB17","series-title":"Logic Programming, Proc. of JICSLP","first-page":"85","article-title":"Integrating modes and subtypes into a prolog type-checker","author":"Rouzaud","year":"1992"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB18","doi-asserted-by":"crossref","unstructured":"G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, Universit\u00e4t Kaiserslautern, Germany, 1989.","DOI":"10.1007\/3-540-50667-5_58"},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB19","unstructured":"Z. Somogyi. The Mercury project. http:\/\/www.cs.mu.oz.au\/~zs\/mercury.html, 1995."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB20","unstructured":"J. J. Wu. A First-order Theory of Types and Polymorphism in Logic Programming. PhD thesis, State University of New York at Stony Brook, 1992."},{"key":"10.1016\/S1571-0661(04)00111-2_NEWBIB21","unstructured":"E. Yardeni, T. Fr\u00fchwirth, and E. Shapiro. Polymorphically typed logic programs. In Pfenning[16], chapter 2, pages 63\u201390."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:12:18Z","timestamp":1705025538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999]]}},"alternative-id":["S1571066104001112"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00111-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}