{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:59Z","timestamp":1725664979756},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_76","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:21:11Z","timestamp":1330294871000},"page":"47-61","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parametric polymorphism for typed Prolog and \u03bbProlog"],"prefix":"10.1007","author":[{"given":"Pascale","family":"Louvet","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Ridoux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"H. Barendregt and K. Hemerik. Types in lambda calculi and programming languages. In N. Jones, editor, European Symp. on Programming, LNCS 432, pages 1\u201335, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52592-0_53"},{"key":"4_CR2","unstructured":"P. Brisset and O. Ridoux. The architecture of an implementation of AProlog: Prolog\/Mali. In Workshop on \u03bbProlog, Philadelphia, PA, USA, 1992. ftp:\/\/ftp.irisa.fr\/local\/lande."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293\u2013322, Plenum Press, New-York, USA, 1978."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"C.M. Elliott. Higher-order unification with dependent function types. In N. Derschowitz, editor, 3rd Int. Conf. Rewriting Techniques and Applications, LNCS 355, pages 121\u2013136, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_104"},{"key":"4_CR5","unstructured":"C.M. Elliott and F. Pfenning. A semi-functional implementation of a higher-order logic programming language. In P. Lee, editor, Topics in Advanced Language Implementation, pages 289\u2013325, MIT Press, 1991."},{"key":"4_CR6","unstructured":"J.-Y. Girard. Interpr\u00e9tation fonctionelle et \u00e9limination des coupures dans l'arithm\u00e9tique d'ordre sup\u00e9rieur. Th\u00e8se de doctorat d'\u00e9tat, Universit\u00e9 de Paris VII, 1972."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"M. Hanus. Horn clause programs with polymorphic types: semantics and resolution. In TAPSOFT'89, LNCS 352, pages 225\u2013240, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-50940-2_38"},{"key":"4_CR8","unstructured":"M. Hanus. Polymorphic higher-order programming in Prolog. In G. Levi and M. Martelli, editors, 6th Int. Conf. Logic Programming, pages 382\u2013397, MIT Press, 1989."},{"key":"4_CR9","unstructured":"P.M. Hill and J.W. Lloyd. The G\u00f6del Programming Language. MIT Press, 1994."},{"key":"4_CR10","unstructured":"P.M. Hill and R.W. Topor. A semantics for typed logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 1\u201362, MIT Press, 1992."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"J. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, LNCS 19, pages 408\u2013425, Springer-Verlag, 1974.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"4_CR12","unstructured":"T.K. Lakshman and U.S. Reddy. Typed Prolog: a semantic reconstruction of the Mycroft-O'Keefe type system. In Int. Logic Programming Symp., pages 202\u2013217, 1991."},{"issue":"1\u20132","key":"4_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","volume":"6","author":"D.A. Miller","year":"1989","unstructured":"D.A. Miller. A logical analysis of modules in logic programming. J. Logic Programming, 6(1\u20132):79\u2013108, 1989.","journal-title":"J. Logic Programming"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"D.A. Miller and G. Nadathur. Higher-order logic programming. In E. Shapiro, editor, 3rd Int. Conf. Logic Programming, LNCS 225, pages 448\u2013462, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16492-8_94"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D.A. Miller","year":"1991","unstructured":"D.A. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"J. Computer and System Sciences"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R.A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"key":"4_CR18","unstructured":"G. Nadathur. A Higher-Order Logic as the Basis for Logic Programming. Ph.D. Thesis, University of Pennsylvania, 1987."},{"key":"4_CR19","unstructured":"G. Nadathur and F. Pfenning. The type system of a higher-order logic programming language. In F. Pfenning, editor, Types in Logic Programming, pages 245\u2013283, MIT Press, 1992."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Partial polymorphic type inference and higher-order unification. In ACM Conf. LISP and Functional Programming, pages 153\u2013163, ACM Press, 1988.","DOI":"10.1145\/62678.62697"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:08:12Z","timestamp":1558267692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}