{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:05Z","timestamp":1725489485060},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_17","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"214-226","source":"Crossref","is-referenced-by-count":2,"title":["Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping"],"prefix":"10.1007","author":[{"given":"Jan-Georg","family":"Smaus","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Deransart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.","key":"17_CR1"},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"On the unification free Prolog programs","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of MFCS, LNCS, pages 1\u201319. Springer-Verlag, 1993."},{"doi-asserted-by":"crossref","unstructured":"C. Beierle. Type inferencing for polymorphic order-sorted logic programs. In L. Sterling, editor, Proceedings of ICLP, pages 765\u2013779. MIT Press, 1995.","key":"17_CR3","DOI":"10.7551\/mitpress\/4298.003.0073"},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-19027-9_6","volume-title":"A polymorphic type system with subtypes for Prolog","author":"R. Dietrich","year":"1988","unstructured":"R. Dietrich and F. Hagl. A polymorphic type system with subtypes for Prolog. In H. Ganzinger, editor, Proceedings of ESOP, LNCS, pages 79\u201393. Springer-Verlag, 1988."},{"unstructured":"F. Fages and M. Paltrinieri. A generict ype system for CLP(X). Technical report, Ecole Normale Sup\u00e9rieure LIENS 97-16, December 1997.","key":"17_CR5"},{"unstructured":"M. Hanus. Logic Programming with Type Specifications, chapter 3, pages 91\u2013140. MIT Press, 1992. In [12].","key":"17_CR6"},{"unstructured":"P. M. Hill and J. W. Lloyd. The G\u00f6del Programming Language. MIT Press, 1994.","key":"17_CR7"},{"unstructured":"P. M. Hill and R. W. Topor. A Semantics for Typed Logic Programs, chapter 1, pages 1\u201361. MIT Press, 1992. In [12].","key":"17_CR8"},{"unstructured":"T.K. Lakshman and U.S. Reddy. Typed Prolog: A semantic reconstruction of the Mycroft-O\u2019Keefe type system. In V. Saraswat and K. Ueda, editors, Proceedings of ILPS, pages 202\u2013217. MIT Press, 1991.","key":"17_CR9"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R. O\u2019Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"unstructured":"G. Nadathur and F. Pfenning. Types in Higher-Order Logic Programming, chapter 9, pages 245\u2013283. MIT Press, 1992. In [12].","key":"17_CR11"},{"unstructured":"F. Pfenning, editor. Types in Logic Programming. MIT Press, 1992.","key":"17_CR12"},{"unstructured":"J.-G. Smaus. Modes and Types in Logic Programming. PhD thesis, University of Kent at Canterbury, 1999.","key":"17_CR13"},{"doi-asserted-by":"crossref","unstructured":"J.-G. Smaus, F. Fages, and P. Deransart. Using modes to ensure subject reduction for typed logicp rograms with subtyping. Technical report, INRIA, 2000. Available via CoRR: http:\/\/arXiv.org\/archive\/cs\/intro.html .","key":"17_CR14","DOI":"10.1007\/3-540-44450-5_17"},{"issue":"1-3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17\u201364, 1996.","journal-title":"Journal of Logic Programming"},{"unstructured":"K. Stroetmann and T. Gla\u03b2. A semantics for types in Prolog: The type system of pan version 2.0. Technical report, Siemens AG, ZFE T SE 1, 81730 M\u00fcnchen, Germany, 1995.","key":"17_CR16"},{"unstructured":"Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.","key":"17_CR17"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T12:12:19Z","timestamp":1708171939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}