A recursive techniques editor for Prolog
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- Brna, P., Bundy, A., Pain, H., Lynch, L. Programming tools for Prolog environments. In: Halla, J., Mellish, C. eds. (1987) Advances in Artificial Intelligence. John Wiley and Sons, Chichester, pp. 251-26
- Grosse, G. (1989). Towards a recursive techniques editor. Unpublished MSc thesis, Dept of Computer Science, Heriot-Watt University.
- Huet, G., Oppen, D. C. Equations and rewrite rules: a survey. In: Book, R. eds. (1980) Formal languages: perspectives and open problems. Academic Press, New York
- 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. Academic Press, New York
- Teitelman, W. and Masinter, L. (1981). The INTERLISP programming environment. IEEE Computer, 25–33.
- Walther, C. Argument-bounded algorithms as a basis for automated termination proofs. In: Lusk, E., Overbeek, R. eds. (1988) 9th Conference on Automated Deduction. Springer-Verlag, Berlin, pp. 602-621
- A recursive techniques editor for Prolog
Volume 20, Issue 2-3 , pp 135-172
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links