{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:20:08Z","timestamp":1743085208880,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","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":[[2001]]},"DOI":"10.1007\/3-540-44716-4_18","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"280-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Well-Typed Logic Programs Are not Wrong"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Deransart","sequence":"first","affiliation":[]},{"given":"Jan-Georg","family":"Smaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the Conference on Mathematical Foundations of Computer Science","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 the Conference on Mathematical Foundations of Computer Science, volume 711 of LNCS, pages 1\u201319. Springer-Verlag, 1993."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"C. Beierle. Type inferencing for polymorphic order-sorted logic programs. In L. Sterling, editor, Proceedings of the Twelfth International Conference on Logic Programming, pages 765\u2013779. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0073"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19\/20","author":"A. Bossi","year":"1991","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 19\/20:149\u2013197, 1991.","journal-title":"Journal of Logic Programming"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","first-page":"22","volume-title":"Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop","author":"M. Comini","year":"1996","unstructured":"M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Proving properties of logic programs by abstract diagnosis. In M. Dams, editor, Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, volume 1192 of LNCS, pages 22\u201350. Springer-Verlag, 1996."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Symposium on Principles of Programming Languages, pages 238\u2013252. ACM Press, 1977.","DOI":"10.1145\/512950.512973"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"P. Deransart and J. Ma luszyski. A Grammatical View of Logic Programming. MIT Press, 1993.","DOI":"10.7551\/mitpress\/3345.001.0001"},{"key":"18_CR7","unstructured":"P. Deransart and J. Ma luszy\u0144ski. Towards soft typing for CLP. In F. Fages, editor, JICSLP\u201998 Post-Conference Workshop on Types for Constraint Logic Programming. \u00c9cole Normale Sup\u00e9rieure, 1998. Available at http:\/\/discipl.inria.fr\/TCLP98\/."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"P. Deransart and J.-G. Smaus. Well-typed logic programs are not wrong. Technical Report RR-4082, INRIA, 2000. Available via CoRR: http:\/\/arXiv.org\/archive\/cs\/intro.html.","DOI":"10.1007\/3-540-44716-4_18"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(95)00038-0","volume":"25","author":"R. Giacobazzi","year":"1995","unstructured":"R. Giacobazzi, S. K. Debray, and G. Levi. Generalized semantics and abstract interpretation for constraint logic programs. Journal of Logic Programming, 25(3):191\u2013247, 1995.","journal-title":"Journal of Logic Programming"},{"key":"18_CR11","unstructured":"M. Hanus. Logic Programming with Type Specifications, chapter 3, pages 91\u2013140. In [23]."},{"key":"18_CR12","unstructured":"P. M. Hill and J. W. Lloyd. The G\u00f6del Programming Language. MIT Press, 1994."},{"key":"18_CR13","unstructured":"P. M. Hill and R. W. Topor. A Semantics for Typed Logic Programs, chapter 1, pages 1\u201361. In [23]."},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-61756-6_74","volume-title":"Limits of ML-definability","author":"S. Kahrs","year":"1996","unstructured":"S. Kahrs. Limits of ML-definability. In H. Kuchen and S. D. Swierstra, editors, Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming, volume 1140 of LNCS, pages 17\u201331. Springer-Verlag, 1996."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/169701.169687","volume":"15","author":"A. J. Kfoury","year":"1993","unstructured":"A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type reconstruction in the presence of polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):290\u2013311, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR16","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 the 1991 International Symposium on Logic Programming, pages 202\u2013217. MIT Press, 1991."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"18_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-61756-6_76","volume-title":"Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming","author":"P. Louvet","year":"1996","unstructured":"P. Louvet and O. Ridoux. Parametric polymorphism for Typed Prolog and \u03bbProlog. In H. Kuchen and S. D. Swierstra, editors, Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming, volume 1140 of LNCS, pages 47\u201361. Springer-Verlag, 1996."},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences, 17(3):348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR20","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"},{"key":"18_CR21","unstructured":"G. Nadathur and F. Pfenning. Types in Higher-Order Logic Programming, chapter 9, pages 245\u2013283. In [23]."},{"key":"18_CR22","unstructured":"R. A. O\u2019Keefe. The Craft of Prolog. MIT Press, 1990."},{"key":"18_CR23","unstructured":"F. Pfenning, editor. Types in Logic Programming. MIT Press, 1992."},{"key":"18_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/10705424_18","volume-title":"Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming","author":"O. Ridoux","year":"1999","unstructured":"O. Ridoux, P. Boizumault, and F. Mal\u00e9sieux. Typed static analysis: Application to groundness analysis of Prolog and \u03bbProlog. In A. Middeldorp and T. Sato, editors, Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming, volume 1722 of LNCS, pages 267\u2013283. Springer-Verlag, 1999."},{"key":"18_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science","author":"J.-G. Smaus","year":"2000","unstructured":"J.-G. Smaus, F. Fages, and P. Deransart. Using modes to ensure subject reduction for typed logic programs with subtyping. In S. Kapoor and S. Prasad, editors, Proceedings of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1974 of LNCS. Springer-Verlag,2000."},{"key":"18_CR26","series-title":"Lect Notes Comput Sci","first-page":"83","volume-title":"Proceedings of the 9th International Workshop on Logic-based Program Synthesis and Transformation","author":"J.-G. Smaus","year":"2000","unstructured":"J.-G. Smaus, P. M. Hill, and A. M. King. Mode analysis domains for typed logic programs. In A. Bossi, editor, Proceedings of the 9th International Workshop on Logic-based Program Synthesis and Transformation, volume 1817 of LNCS, pages 83\u2013102, 2000."},{"issue":"13","key":"18_CR27","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(13):17\u201364, 1996.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0743-1066(96)00105-7","volume":"30","author":"P. Tarau","year":"1997","unstructured":"P. Tarau, K. De Bosschere, and B. Demoen. On Delphi lemmas and other memoing techniques for deterministic logic programs. Journal of Logic Programming, 30(2):145\u2013163, 1997.","journal-title":"Journal of Logic Programming"},{"key":"18_CR29","unstructured":"Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991."},{"key":"18_CR30","unstructured":"Simon Thompson. Miranda: The Craft of Functional Programming. Addison Wesley, 1995."}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:55:36Z","timestamp":1737370536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}