{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:56:33Z","timestamp":1772024193230,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540164425","type":"print"},{"value":"9783540397823","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16442-1_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:40:48Z","timestamp":1330195248000},"page":"327-338","source":"Crossref","is-referenced-by-count":52,"title":["An application of abstract interpretation of logic programs: Occur check reduction"],"prefix":"10.1007","author":[{"given":"Harald","family":"S\u00f8ndergaard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Cousot, P. and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proc. 4th ACM POPL Symp., Los Angeles, California (June 1977) 238\u2013252","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"25_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"Eder, E., Properties of substitutions and unifications, Journal of Symbolic Computation 1,1 (March 1985) 31\u201346","journal-title":"Journal of Symbolic Computation"},{"key":"25_CR3","unstructured":"Jones, N. D., P. Sestoft and H. S\u00f8ndergaard, An experiment in partial evaluation: The generation of a compiler generator, in LNCS 202: Rewriting Techniques and Applications (ed. J.-P. Jouannaud), Springer Verlag (1985) 124\u2013140"},{"issue":"4","key":"25_CR4","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1145\/321906.321919","volume":"22","author":"R. Kowalski","year":"1975","unstructured":"Kowalski, R., A proof procedure using connection graphs, Journal of the ACM 22,4 (October 1975) 572\u2013595","journal-title":"Journal of the ACM"},{"key":"25_CR5","series-title":"DAI Research Paper","volume-title":"The Automatic Generation of Mode Declarations for Prolog Programs","author":"C. S. Mellish","year":"1981","unstructured":"Mellish, C. S., The Automatic Generation of Mode Declarations for Prolog Programs, DAI Research Paper no. 163, University of Edinburgh, Scotland (1981)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Mellish, C. S., Abstract Interpretation of Prolog Programs, extended abstract presented at the Workshop on Abstract Interpretation of Declarative Languages, Canterbury, England (August 1985)","DOI":"10.1007\/3-540-16492-8_95"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","volume":"18","author":"F. Nielson","year":"1982","unstructured":"Nielson, F., A denotational framework for data flow analysis, Acta Informatica 18 (1982) 265\u2013287","journal-title":"Acta Informatica"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Plaisted, D., The occur-check problem in Prolog, Proc. Intl. Symp. Logic Programming, Atlantic City, New Jersey (February 1984) 272\u2013280","DOI":"10.1007\/BF03037324"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J. A., A machine-oriented logic based on the resolution principle, Journal of the ACM 12,1 (January 1965) 23\u201341","journal-title":"Journal of the ACM"},{"key":"25_CR10","series-title":"DAI Research Report","volume-title":"Implementing Prolog \u2014 Compiling Predicate Logic Programs","author":"D. H. D. D. Warren","year":"1977","unstructured":"Warren, D. H. D., Implementing Prolog \u2014 Compiling Predicate Logic Programs, DAI Research Report no. 39, University of Edinburgh, Scotland (1977)"}],"container-title":["Lecture Notes in Computer Science","ESOP 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16442-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:42:52Z","timestamp":1640914972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}