{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:18Z","timestamp":1725456018239},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540530107"},{"type":"electronic","value":"9783540462989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0024187","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T04:49:34Z","timestamp":1132375774000},"page":"222-237","source":"Crossref","is-referenced-by-count":3,"title":["Static type analysis of prolog procedures for ensuring correctness"],"prefix":"10.1007","author":[{"given":"Pierre","family":"De Boeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baudouin Le","family":"Charlier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"key":"16_CR1","unstructured":"A. Bansal, L. Sterling, An abstract interpretation scheme for logic programs based on type expression. In Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo 1988, pp. 422\u2013429."},{"key":"16_CR2","unstructured":"M. Bruynooghe, A framework for the Abstract Interpretation of Logic Programs. Technical Report CW62, Department of Computer Science, Katholieke Universiteit Leuven, October 1987."},{"key":"16_CR3","unstructured":"M. Bruynooghe, Adding Redundancy to Obtain More Reliable and More Readable Prolog Programs. In Proc. 1st Int. Logic Programming Conf., Marseille, pp. 129\u2013133."},{"key":"16_CR4","unstructured":"M. Bruynooghe, A. Mulkers, K.Musumbu, Compile-time garbage collection for Prolog. Draft, Department of Computer Science, Katholieke Universiteit Leuven, April 1988."},{"key":"16_CR5","unstructured":"S.K. Debray, D.S. Warren, Automatic mode inferencing for Prolog programs. Proc. 1986 Logic Programming Symposium, Salt Lake City, Sept. 86, IEEE Society Press, 1986, pp. 78\u201388."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"P. De Boeck, Static Type Analysis of Prolog Procedures for Ensuring Correctness. Technical Report (first version), Institut d'Informatique, Namur, March 1990.","DOI":"10.1007\/BFb0024187"},{"key":"16_CR7","unstructured":"Y. Deville, Logic Programming: Systematic Program Development. Addison-Wesley, 1990."},{"key":"16_CR8","unstructured":"G. Janssens, Deriving run time properties of logic programs by means of abstract interpretation. Ph.D. Thesis, Department of Computer Science, Katholieke Universiteit Leuven, March 1990."},{"key":"16_CR9","unstructured":"N.D. Jones, H. Sondergaard, A Semantics Based Framework for the Abstract Interpretation of Prolog. In Abstract Interpretation of Declarative Languages, eds. S. Abramsky and C. Hankin, Ellis Horwood."},{"key":"16_CR10","unstructured":"T. Kanomori, K. Horiuchi, Type inference in Prolog and its application. Proc. IJCAI 85, Aug. 85, pp. 704\u2013707."},{"key":"16_CR11","unstructured":"F. Kluzniak, Type Synthesis for Ground Prolog. In Proc. 4th Int. Conf. Logic Programming, Melbourne, may 1987."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"C.S. Mellish, Abstract interpretation of Prolog programs. In Proc. Third Int. Conf. Logic Programming, London, July 86, LNCS 225, Springer Verlag 1986, pp. 463\u2013474.","DOI":"10.1007\/3-540-16492-8_95"},{"issue":"1","key":"16_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","volume":"2","author":"C.S. Mellish","year":"1985","unstructured":"C.S. Mellish, Some global optimisations for a Prolog compiler. J. Logic Programming, Vol. 2(1), 1985, pp. 43\u201366.","journal-title":"J. Logic Programming"},{"key":"16_CR14","unstructured":"P. Mishra, Towards a theory of types in Prolog. Proc. 1984 Symposium on Logic Programming, Atlanta City, IEEE Society Press 1984, pp. 289\u2013298."},{"key":"16_CR15","unstructured":"K. Musumbu, Interpretation Abstraite de Programmes Prolog. Ph.D. Thesis, Department of Computer Science, Institut d'Informatique, Namur, April 1990."},{"key":"16_CR16","unstructured":"Z. Somogyi, A system of precise modes for logic programs. In Proc. 4th Int. Conf. on Logic Programming, Melbourne 1987."},{"key":"16_CR17","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1984","unstructured":"K.L. Clark, Negation as failure. In Logic and Data Bases, eds. H. Gallaire and J. Minker, Plenum Press, N.Y. 1984."},{"key":"16_CR18","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, R.A. O'Keefe, A polymorphic type system for Prolog. In Artificial Intelligence, Vol.23, 1984, pp. 295\u2013307.","journal-title":"In Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:48:34Z","timestamp":1586555314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540530107","9783540462989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024187","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}