Continuations of logic programs | SpringerLink
Skip to main content
Springer Nature Link
Log in

Continuations of logic programs

  • Invited Papers
  • Conference paper
  • First Online:
Algebraic Logic and Universal Algebra in Computer Science (ALUACS 1988)

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

  • 257 Accesses

Abstract

We have demonstrated that the concept of continuation based transformations can be successfully carried over from functional programming to logic programming. Various known techniques of logic programming, such as removal of linear recursion, parsing by difference lists and removal of left recursion in grammars can be considered as special instances of the technique.

This paper is in final form and no version of it will be submitted for publication elsewhere.

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.

7 References

  1. S. Debray “Optimizing Almost-Tail-Recursive Prolog Programs,” Proc. IFIP International Conference on Functional Programming Languages and Computer Architecture. Nancy, France, 1985.

    Google Scholar 

  2. H. J. Komorowski “Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog,” Proceedings of the 9th ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, 255–267 (1982).

    Google Scholar 

  3. S. Tamaki and T. Sato “Unfold/Fold Transformations of Logic Programs,” Proc. 2nd. Logic Programming Conference, Uppsala, Sweden, 1984.

    Google Scholar 

  4. R. Venken “A Prolog meta-interpreter for partial evaluation and its application to source to source transformation and query optimization,” in T.O'Shea (ed.): ECAI-84. Advances in Artificial Intelligence, Pisa, Italy, 91–100. North-Holland, 1984.

    Google Scholar 

  5. M. Wand “Continuation based program transformation strategies,” Journal of the ACM, 27 (1980) 164–180.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Zhang and P. W. Grant “An Automatic Difference-list Transformation Algorithm for Prolog,” in Proceedings of ECAI-88. European Conf. on Artificial Intelligence, Munich 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, SUNY College at New Paltz, 12561, New Paltz, N.Y.

    H. Peter Gumm

Authors
  1. H. Peter Gumm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Clifford H. Bergman Roger D. Maddux Don L. Pigozzi

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gumm, H.P. (1990). Continuations of logic programs. In: Bergman, C.H., Maddux, R.D., Pigozzi, D.L. (eds) Algebraic Logic and Universal Algebra in Computer Science. ALUACS 1988. Lecture Notes in Computer Science, vol 425. Springer, New York, NY. https://doi.org/10.1007/BFb0043077

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97288-6

  • Online ISBN: 978-0-387-34804-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation