Finding the least fixed point using wait-declarations in Prolog
To find the least fixed point of a set of equations is an important and common problem when analyzing programs. This paper presents a very efficient way to use wait-declarations in SICStus Prolog to perform this computation.
It is also shown how partial evaluation is used to generate the programs finding the least fixed point. Finding the least fixed point can be used for optimization of Prolog programs. As an application of this technique, we present a method for identifying unused arguments.
Unable to display preview. Download preview PDF.
- Abra87.Abramsky,S. and Hankin,C., Abstract Interpretation of Declarative Languages, Ellis Horwood Limited, 1987Google Scholar
- Carl88.Carlsson, M. and Widén, J., SICStus Prolog User's Manual, Research report R88007, SICS, Sweden, 1988.Google Scholar
- Hari90.Haridi, S., A Logic Programming Language Based on the Andorra Model, New Generation Computing, 7 (1990)Google Scholar
- OKee87.O'Keefe, R., Finite Fixed-Point Problems, in Proceedings of the Fourth International Conference on Logic Programming in Melbourne 1987, The MIT PressGoogle Scholar
- Sahl90.Sahlin, D., The Mixtus Approach to Automatic Partial Evaluation of Full Prolog, in proceedings of the 1990 North American Conference on Logic Programming, The MIT PressGoogle Scholar
- ThZo87.Thom, J.A. and Zobel, J., NU-Prolog Reference Manual, version 1.1, Technical Report 86/10, Machine Intelligence Project, Dept. of Computer Science, University of MelbourneGoogle Scholar
- Wærn88.Wærn, A., An Implementation Technique for the Abstract Interpretation of Prolog, SICS Research Report R88004Google Scholar