A Revised Textual Tree Trace Notation for Prolog

Taylor, Chris and du Boulay, Benedict and Patel, Mukesh J. (1999) A Revised Textual Tree Trace Notation for Prolog. In: Brna, Paul and du Boulay, Benedict and Pain, Helen, eds. Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study. Ablex Publishing Corporation, pp. 267-281. ISBN 1-56750-434-5. (Full text available)

Download (306kB) Preview
Download (164kB) Preview


This paper describes a ''textual tree trace'' (TTT) notation for representing the execution of Prolog programs. Compact, textual and non-linear, it provides detailed information about variable binding and execution history, and distinguishes several modes of goal failure. The revised form given here, yet to be empirically tested, is partly informed by Paul Mulholland's empirical comparisons of Prolog trace notations, in which an earlier version of the TTT notation was amongst those studied and criticised. The work presented here is an updated version of a previous workshop paper (Taylor, du Boulay, & Patel, 1994).

Item Type: Book section
Uncontrolled keywords: Prolog, tracers
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 06 Oct 2009 17:10 UTC
Last Modified: 16 Jul 2014 10:30 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21794 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year