Skip to main content
SpringerLink
Log in

Finding the least fixed point using wait-declarations in Prolog

  • Logic Programming
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 456))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky,S. and Hankin,C., Abstract Interpretation of Declarative Languages, Ellis Horwood Limited, 1987

    Google Scholar 

  2. Carlsson, M. and Widén, J., SICStus Prolog User's Manual, Research report R88007, SICS, Sweden, 1988.

    Google Scholar 

  3. Haridi, S., A Logic Programming Language Based on the Andorra Model, New Generation Computing, 7 (1990)

    Google Scholar 

  4. O'Keefe, R., Finite Fixed-Point Problems, in Proceedings of the Fourth International Conference on Logic Programming in Melbourne 1987, The MIT Press

    Google Scholar 

  5. 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 Press

    Google Scholar 

  6. 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 Melbourne

    Google Scholar 

  7. Wærn, A., An Implementation Technique for the Abstract Interpretation of Prolog, SICS Research Report R88004

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SICS, Box 1263, S-164 28, Kista, Sweden

    Dan Sahlin

Authors
  1. Dan Sahlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sahlin, D. (1990). Finding the least fixed point using wait-declarations in Prolog. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024182

Download citation

  • DOI: https://doi.org/10.1007/BFb0024182

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53010-7

  • Online ISBN: 978-3-540-46298-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation