An application of abstract interpretation of logic programs: Occur check reduction
- 1 January 1986
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 327-338
- https://doi.org/10.1007/3-540-16442-1_25
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Abstract interpretation of Prolog programsLecture Notes in Computer Science, 1986
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- The occur-check problem in PrologNew Generation Computing, 1984
- A denotational framework for data flow analysisActa Informatica, 1982
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965