Skip to main content
SpringerLink
Log in

Logical Loops

  • Conference paper
  • First Online:
Logic Programming (ICLP 2002)

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

Included in the following conference series:

Abstract

We present a concrete proposal for enhancing Prolog and Prolog based Constraint Logic Programming languages with a new language construct, the logical loop. This is a shorthand notation for the most commonly used recursive control structure: the iteration or tail recursion. We argue that this enhancement fits well with the existing language concepts, enhances productivity and maintainability, and helps newcomers to the language by providing concepts that are familiar from many other programming languages. The language extension is implemented and has been in everyday use over several years within the ECLiPSesystem.

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. K. R. Apt. Arrays, bounded quantification and iteration in logic and constraint logic programming. Science of Computer Programming, 26(1–3):133–148, 1996.

    Article  MathSciNet  Google Scholar 

  2. J. Barklund and J. Bevemyr. Prolog with arrays and bounded quantifications. In A. Voronkov, editor, Proceedings of LPAR’93, pages 28–39. Springer, 1993.

    Google Scholar 

  3. J. Barklund and P. Hill. Extending Gödel for expressing restricted quantifications and arrays. Technical Report No. 102, Uppsala University, March 1995.

    Google Scholar 

  4. ECLiPSe Team. ECLiPSe User Manual Version 4.0. Technical report, IC-Parc, Imperial College, London, July 1998.

    Google Scholar 

  5. M. Hanus. Curry: An integrated functional logic language. Technical report, Univerity of Kiel, Kiel, Germany, June 2000.

    Google Scholar 

  6. P. Hill and J. Lloyd. The Gödel Programming Language. MIT Press, 1994.

    Google Scholar 

  7. L. Naish. Higher-order logic programming in Prolog. Technical Report 96/2, University of Melbourne, Feb. 1996.

    Google Scholar 

  8. J.-F. Puget. A C++ implementation of CLP. In Proceedings of SPICIS 94, Singapore, November 1994.

    Google Scholar 

  9. Z. Somogyi, F. Henderson, and T. Conway. Mercury: an efficient purely declarative logic programming language. In Proceedings of the Australian Computer Science Conference, pages 499–512, Glenelg, Australia, February 1995.

    Google Scholar 

  10. P. Van Roy. Logic programming in Oz with Mozart. In D. D. Schreye, editor, International Conference on Logic Programming, pages 38–51, Las Cruces, NM, USA, Nov. 1999. The MIT Press.

    Google Scholar 

  11. A. Voronkov. Logic programming with bounded quantifiers. In A. Voronkov, editor, Logic Programming, First and Second Russian Conference, pages 486–514. Springer LNAI, 1990/1991.

    Google Scholar 

  12. D. H. D. Warren. Higher-order extensions to Prolog-are they needed? Machine Intelligence, 10:441–454, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IC-Parc, Imperial College, London, SW7 2AZ, UK

    Joachim Schimpf

Authors
  1. Joachim Schimpf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Melbourne, 221 Bouverie St., Carlton, 3053, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schimpf, J. (2002). Logical Loops. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45619-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43930-1

  • Online ISBN: 978-3-540-45619-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation