{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:32Z","timestamp":1725663692567},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_108","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:50:18Z","timestamp":1330210218000},"page":"311-322","source":"Crossref","is-referenced-by-count":3,"title":["Abstract interpretation for type checking"],"prefix":"10.1007","author":[{"given":"G.","family":"Fil\u00e8","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sottero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"K.Apt & D.Pedreschi; Studies in pure Prolog: termination. Proc. Symp. on Computational Logic, Lec. Notes in AI, n.1, Springer Verlag, 1990.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"J.Bakus et al.; The FORTRAN automatic coding system. Western Joint Computer Conf. (1957), 188\u2013198.","DOI":"10.1145\/1455567.1455599"},{"key":"26_CR3","unstructured":"R.N.Bol, K.A.Apt, J.W.Klop; An analysis of loop checking mechanisms for logic programs. CWI, R. CS-R8942, 1989."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"A.Bossi, N.Cocco & M.Fabris; Proving termination of logic programs by exploiting term properties. Dep. of Math., Univ. of Padova, R.21, 1990. Accepted to the TAPSOFT Conf., Brighton, 1991.","DOI":"10.1007\/3540539816_66"},{"key":"26_CR5","unstructured":"M.Bezem; Characterizing termination of logic programs with level mappings. Proc. North American conf. on Logic Programming, Cleveland, eds. L.Lusk & R.Overbeek, MIT Press, (1989), 69\u201380."},{"key":"26_CR6","unstructured":"M.Bruijhooghe; A practical framework for the abstract interpretation of logic programs. To appear in the J. of Logic Programming."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"A.Cortesi & G.Fil\u00e8; Abstract Interpretation: an abstract domain for groundness, sharing, freeness and compoundness analysis. Dep. of Math., University of Padova, R.4-1991; also to appear in the Proc. of the ACM SIGPLAN Symposium on partial evaluation and semantics based program manipulation, New Haven, 1991.","DOI":"10.1145\/115865.115872"},{"key":"26_CR8","unstructured":"P.Codognet & G.Fil\u00e8; Coomputations, abstractions and constraints. In preparation."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"M.Hanus; Horn clause programs with polymorphic types: semantics and resolution. Proc. of TAPSOFT 89, LNCS 352, 225\u2013240.","DOI":"10.1007\/3-540-50940-2_38"},{"key":"26_CR10","unstructured":"T.Kanamori & T.Kawamura; Abstract interpretation based on OLDT-resolution. ICOT TR, 1990."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"J.Lloyd; Foundations of logic programming. Springer Verlag, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"26_CR12","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.Comput. System Sci. 17, (1978), 348\u2013375.","journal-title":"J.Comput. System Sci."},{"key":"26_CR13","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. O'Keefe; A polymorphic type system for Prolog. Artificial intelligence 23, (1984), 295\u2013307.","journal-title":"Artificial intelligence"},{"key":"26_CR14","volume-title":"A tutorial on abstract interpretation of logic program","author":"K. Merriot","year":"1989","unstructured":"K. Merriot & H. Sondergaard; A tutorial on abstract interpretation of logic program. Tutorial of the North American conf. on Logic Programming, Cleveland, 1989."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01940219","volume":"5","author":"P. Naur","year":"1965","unstructured":"P. Naur; Checking of operand types in Algol compilers. BIT 5, (1965), 151\u2013163.","journal-title":"BIT"},{"key":"26_CR16","first-page":"84","volume":"225","author":"H. Tamaki","year":"1986","unstructured":"H. Tamaki & T. Sato; OLD resolution with tabulation. Proc. of the 3rd Conf. on Logic programming, London, LNCS 225, (1986), 84\u201398.","journal-title":"LNCS"}],"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\/3-540-54444-5_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:32Z","timestamp":1605646472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}