THE TRANSPARENT PROLOG MACHINE (TPM) - AN EXECUTION MODEL AND GRAPHICAL DEBUGGER FOR LOGIC PROGRAMMING

被引：28

作者：

EISENSTADT, M ^{[1
]}

BRAYSHAW, M ^{[1
]}

机构：

[1] OPEN UNIV,HUMAN RECOGNIT RES LAB,MILTON KEYNES MK7 6AA,BUCKS,ENGLAND

来源：

JOURNAL OF LOGIC PROGRAMMING | 1988年 / 5卷 / 04期

关键词：

Computer Graphics - Computer Metatheory--Programming Theory;

D O I：

10.1016/0743-1066(88)90001-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An augmented AND/OR tree representation of logic programs is presented as the basis for an advanced graphical tracing and debugging facility for PROLOG. An extension of our earlier work on 'retrospective zooming', this representation offers several distinct advantages over existing tracing and debugging facilities. By enhancing AND/OR trees to include 'status boxes' rather than simple 'nodes', it is possible to display both a long-distance view of execution and the full details of clause-head matching. Graphical 'collapsing' techniques enable the model to deal with user-defined abstractions, higher-order predicates such as setof, and definite-clause grammars. The current implementation runs on modern graphics workstations and is written in PROLOG.

引用

页码：277 / 342

页数：66