BOP --- a Conditional Term Rewriting System
D. STOTT PARKER
UCLA Computer Science Dept.
3532 Boelter Hall
(310) 825-6871 (OFC)
(310) 825-1322 (SEC)
(310) 825-2273 (FAX)

BOP --- Publications and Implementation


BOP

Bop 0.2 Manual

D. Stott Parker

Technical Report CSD-920027 (94pp), June 1992.

Bop is a portable extension of Edinburgh-style Prolog environments, that integrates term rewriting with Prolog. Bop rests on a kind of conditional rewrite rules, that supports various term rewriting styles. The default rewriting mechanism is nondeterministic and lazy. It offers the following:
  • control over the compilation of rewrite rules, permitting user-defined pattern matching and/or type checking.
  • a rule compiler that produces fairly efficient Prolog code by avoiding redundant computation and exploiting features of modern Prolog systems such as clause indexing and delay primitives.
  • ability to produce compiled rule output as a Prolog file that can subsequently be used independently in other applications.
  • a full debugger/tracer with spypoint management for rewrite rules.
  • a sizeable library of standard programs.
  • a collection of demonstration programs, with a modest demo interaction shell encouraging exploration.
  • a system written almost entirely in Prolog, intended to be portable across Edinburgh Prolog platforms. Bop has been run successfully on the C-Prolog, SICStus, and Quintus Prolog systems.
Bop was developed particularly in order to support research on stream processing and constraint processing, but it should also be of help in the exploration of other paradigmatic extensions of logic programming. This manual overviews the system and describes the primitives available, emphasizing its application to stream processing problems.

D. Stott Parker (stott@cs.ucla.edu)
Fri May 30 12:59:43 PDT 1997