Skip to main content
SpringerLink
Log in

Applications of Unfolding in Prolog Programming

  • Chapter
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 47 Accesses

Abstract

Programming in Prolog is like programming in any other language, in that much of the difficulty is caused by having to manage the complexity of the development process. The adoption of appropriate programming conventions can help by promoting clearer and more easily maintained programs. However, such conventions often result in inefficient programs. In this paper we demonstrate how partial evaluation can be used to overcome this drawback in the case of three specific programming conventions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clocksin, W. F., and C. S. Mellish, Programming in Prolog, Springer-Verlag (1981).

    Google Scholar 

  2. Demoen, B., On the transformation of a Prolog program to a more efficient binary program, Proceedings of the workshop on logic program synthesis and transformation, 1992, Springer-Verlag Workshops in Computing (this volume).

    Google Scholar 

  3. Gallagher, J., A system for specialising logic programs, Report TR-91–32, Computer Science Department, University of Bristol, UK, 1991.

    Google Scholar 

  4. Gallagher, J., and D. A. de Waal, Specialisation in context, Proceedings of the workshop on logic program synthesis and transformation, 1992, Springer-Verlag Workshops in Computing (this volume).

    Google Scholar 

  5. Jones, J., Prolog, data abstraction, and program transformation: a preliminary report, Research report 91/1, Department of Computer Science, University of Hull, UK, 1991.

    Google Scholar 

  6. Komorowski, J., Towards a programming methodology founded on partial deduction, Proceedings of the 1990 European Conference on Artificial Intelligence, L. C. Aiello ( Ed. ), Pitman (1990), 404–409.

    Google Scholar 

  7. Lakhotia, A., Incorporating `programming techniques’ into Prolog programs, Logic programming: Proceedings of the 1989 North American Conference, E. L. Lush and R. A. Overbeek ( Eds. ), MIT Press (1989), 426–440.

    Google Scholar 

  8. Lakhotia, A., and L. Sterling, ProMiX: A Prolog partial evaluation system, in The Practice of Prolog, L. Sterling ( Ed. ), MIT Press (1990), 137–179.

    Google Scholar 

  9. Lakhotia, A., and L. Sterling, How to control unfolding when specializing interpreters, New Generation Computing 8 (1990), 61–70.

    Article  MATH  Google Scholar 

  10. Lakhotia, A., Private communication by email, 13th May, 1991.

    Google Scholar 

  11. Lloyd, J. W., and J. C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming 11 (1991), 217–242.

    Article  MathSciNet  MATH  Google Scholar 

  12. Owen, S., Issues in the partial evaluation of meta-interpreters, in Meta-Programming in Logic Programming, H. Abramson and M. H. Rogers (Eds.) MIT Press (1989), 319–339.

    Google Scholar 

  13. Prestwich, S., An unfold rule for full Prolog, Proceedings of the workshop on logic program synthesis and transformation, 1992, Springer-Verlag Workshops in Computing (this volume).

    Google Scholar 

  14. Proietti, M., and A. Pettorossi, Semantics preserving transformation rules for Prolog, Symposium on partial evaluation and semantics-based program manipulation, SIGPLAN Notices 26 (1991), 274–284.

    Article  Google Scholar 

  15. Sestoft, P., and A. V. Zamulin, Annotated bibliography on partial evaluation and mixed computation, New Generation Computing 6 (1988), 309–354.

    Article  MATH  Google Scholar 

  16. Sterling, L., and E. Shapiro, The Art of Prolog, MIT Press (1986).

    Google Scholar 

  17. Venken, R., and B. Demoen, A partial evaluation system for Prolog: some practical considerations, New Generation Computing 6 (1988), 279–290.

    Article  Google Scholar 

  18. Warren, D. S., Memoing for logic programs, Communications of the ACM, 35 (3) (1992), 94–111.

    Article  MathSciNet  Google Scholar 

  19. Wilk, P. F., Comment in C-Prolog library file `Unfold’, dated May, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hull, Hull, HU6 7RX, UK

    John Jones

Authors
  1. John Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University, M13 9PL, Manchester, UK

    Kung-Kiu Lau Bsc, PhD  & Timothy Paul Clement Ma, DPhil  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag London

About this chapter

Cite this chapter

Jones, J. (1993). Applications of Unfolding in Prolog Programming. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3560-9_13

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19806-2

  • Online ISBN: 978-1-4471-3560-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation