Using Data Structures

  • William F. Clocksin
  • Christopher S. Mellish


This definition is cryptic and perhaps outdated. Recursion is now a very popular and powerful technique in the world of non-numerical programming. The idea of recursion is used in two ways. It can be used to describe structures that have other structures as components. It can also be used to describe programs that need to satisfy a copy of themselves before they themselves can succeed. Sometimes, beginners view recursion with some suspicion, because, how is it possible for some relationship to be defined in terms of itself? In Prolog, recursion is the normal and natural way of viewing data structures and programs. We hope that the theme of this chapter recursion, will be made explicit in a comfortable and unobtrusive way.


Basic Part Input List Empty List Output List Difference List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • William F. Clocksin
    • 1
  • Christopher S. Mellish
    • 2
  1. 1.Department of Computing, Wheatley CampusOxford Brookes UniversityOxfordUK
  2. 2.Department of Artificial IntelligenceUniversity of EdinburghEdinburghUK

Personalised recommendations