Abstract
The occur check in Robinson unification is superfluous in most unifications that take place in practice. The present paper is concerned with the problem of determining circumstances under which the occur check may be safely dispensed with. The method given draws on one outlined by David Plaisted. The framework, however, differs in that we systematically apply the abstract interpretation principle to logic programs. The aim is to give a clear presentation and to facilitate justification of the soundness of the method.
This work was done at Datalogisk Institut, Copenhagen University
Chapter PDF
Similar content being viewed by others
9. References
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–252
Eder, E., Properties of substitutions and unifications, Journal of Symbolic Computation 1,1 (March 1985) 31–46
Jones, N. D., P. Sestoft and H. Søndergaard, 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–140
Kowalski, R., A proof procedure using connection graphs, Journal of the ACM 22,4 (October 1975) 572–595
Mellish, C. S., The Automatic Generation of Mode Declarations for Prolog Programs, DAI Research Paper no. 163, University of Edinburgh, Scotland (1981)
Mellish, C. S., Abstract Interpretation of Prolog Programs, extended abstract presented at the Workshop on Abstract Interpretation of Declarative Languages, Canterbury, England (August 1985)
Nielson, F., A denotational framework for data flow analysis, Acta Informatica 18 (1982) 265–287
Plaisted, D., The occur-check problem in Prolog, Proc. Intl. Symp. Logic Programming, Atlantic City, New Jersey (February 1984) 272–280
Robinson, J. A., A machine-oriented logic based on the resolution principle, Journal of the ACM 12,1 (January 1965) 23–41
Warren, D. H. D., Implementing Prolog — Compiling Predicate Logic Programs, DAI Research Report no. 39, University of Edinburgh, Scotland (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Søndergaard, H. (1986). An application of abstract interpretation of logic programs: Occur check reduction. In: Robinet, B., Wilhelm, R. (eds) ESOP 86. ESOP 1986. Lecture Notes in Computer Science, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16442-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-16442-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16442-5
Online ISBN: 978-3-540-39782-3
eBook Packages: Springer Book Archive