Skip to main content
Springer Nature Link
Log in

On the unification free prolog programs

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

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

  • 211 Accesses

Abstract

We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are types and generic expressions for types. As already noticed by other researchers, such a replacement offers a possibility of improving the efficiency of program's execution.

The work of the first author was partly supported by ESPRIT Basic Research Action 6810 (Compulog 2). This research was done partly during the second author's stay at Centre for Mathematics and Computer Science, Amsterdam.

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.

Similar content being viewed by others

References

  1. I. Attali and P. Franchi-Zannettacci. Unification-free execution of TYPOL programs by semantic attribute evaluation. In R.A. Kowalski and K.A. Bowen, editors, Proceedings of the Fifth International Conference on Logic Programming, pages 160–177. The MIT Press, 1988.

    Google Scholar 

  2. K. R. Apt and A. Pellegrini. Why the occur-check is not a problem. In M. Bruynooghe and M. Wirsing, editors, Proceeding of the Fourth International Symposium on Programming Language Implementation and Logic Programming (PULP 92), Lecture Notes in Computer Science 631, pages 69–86, Berlin, 1992. Springer-Verlag.

    Google Scholar 

  3. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier, 1990. Vol. B.

    Google Scholar 

  4. F. Bronsard, T.K. Lakshman, and U.S. Reddy. A framework of directionality for proving termination of logic programs. In K.R. Apt, editor, Proc. of the Joint International Conference and Symposium on Logic Programming, pages 321–335. MIT Press, 1992.

    Google Scholar 

  5. R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991.

    Google Scholar 

  6. P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29–38, Boston, 1985.

    Google Scholar 

  7. P. Deransart and J. Maluszynski. Relating Logic Programs and Attribute Grammars. Journal of Logic Programming, 2:119–156, 1985.

    Google Scholar 

  8. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.

    Google Scholar 

  9. J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann, Los Altos, Ca., 1988.

    Google Scholar 

  10. J. Maluszynski and H. J. Komorowski. Unification-free execution of logic programs. In Proceedings of the 1985 IEEE Symposium on Logic Programming, pages 78–86, Boston, 1985. IEEE Computer Society Press.

    Google Scholar 

  11. U.S. Reddy. On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors, Functional and Logic Programming, pages 3–36. Prentice-Hall, 1986.

    Google Scholar 

  12. D.A. Rosenblueth. Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs. Technical Report 7, Universidad National Autonoma de Mexico, Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas, 1991.

    Google Scholar 

  13. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.

    Google Scholar 

  14. E. Yardeni, T. Frühwirth, and E. Shapiro. Polymorphically typed logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 63–90. MIT Press, Cambridge, Massachussets, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 4079, 1009, AB Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Faculty of Mathematics and Computer Science, University of Amsterdam, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Krzysztof R. Apt

  3. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Belzoni 7, 35131, Padova, Italy

    Sandro Etalle

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandro Etalle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apt, K.R., Etalle, S. (1993). On the unification free prolog programs. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics