Skip to main content
SpringerLink
Log in

A recursive techniques editor for Prolog

  • Published:
Instructional Science Aims and scope Submit manuscript

Abstract

We describe an editor geared to recursive Prolog procedures. It is similar to the structure editors built for many programming languages, except that instead of just ensuring the correctness of the syntax of the procedures built by the editor, the editor also ensures the correct use of recursion. By correct here we mean that the recursive procedure is guaranteed to terminate and to be well-defined. Within these constraints we have tried to ensure that the range of procedures that can be built is as complete as possible.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brna, P., Bundy, A., Pain, H. and Lynch, L. (1987). Programming tools for Prolog environments. In J. Halla, and C. Mellish (Eds.), Advances in Artificial Intelligence, pp. 251–26. Society for the Study of Artificial Intelligence and Simulation of Behaviour. Chichester: John Wiley and Sons. Previously, Research Paper No 302, Department of Artificial Intellignece, University of Edinburgh.

    Google Scholar 

  • Grosse, G. (1989). Towards a recursive techniques editor. Unpublished MSc thesis, Dept of Computer Science, Heriot-Watt University.

  • Huet, G. and Oppen, D. C. (1980). Equations and rewrite rules: a survey. In R. Book (Ed.), Formal languages: perspectives and open problems. New York: Academic Press. Presented at the conference on formal language theory, Santa Barbara, 1979. Available from SRI International as Technical Report CSL-lll.

    Google Scholar 

  • Kahney, H. (1982). An in-depth study of the cognitive bchaviour of novice programmers. Unpublished PhD thesis. Human Cognition Research Laboratory, The Open University, Milton Keynes.

  • Péter, R. (1967). Recursive functions. New York: Academic Press. Translated by Istvan Foeldes.

    Google Scholar 

  • Teitelman, W. and Masinter, L. (1981). The INTERLISP programming environment. IEEE Computer, 25–33.

  • Walther, C. (1988). Argument-bounded algorithms as a basis for automated termination proofs. In E. Lusk and R. Overbeek (Eds.), 9th Conference on Automated Deduction, pp. 602–621. Berlin: Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, EH1 1HN, Edinburgh, U.K.

    Alan Bundy & Paul Brna

  2. FG Intelleltik, TH Darmstadt, Alexanderstrasse 10, Germany

    Gerd Grosse

Authors
  1. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerd Grosse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Brna
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bundy, A., Grosse, G. & Brna, P. A recursive techniques editor for Prolog. Instr Sci 20, 135–172 (1991). https://doi.org/10.1007/BF00120880

Download citation

  • Issue Date:

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

Keywords

Search

Navigation