Document Type
Technical Report
Publication Date
11-1-1994
Technical Report Number
PCS-TR94-240
Abstract
This paper extends Equational Programming (EP)—a declarative, symbolic programming language—to allow programs to manipulate incrementally defined and modified input terms and to avoid repeated work when evaluating these incremental terms. This paper represents two key aspects of this extension: a notation for representing revision and a modification to EP's runtime library to accomodate this notation. Unlike Field's method of incremental term rewriting, which is designed for more general but less efficient term-rewriting systems, this paper's method accomodates EP's restrictions (in particular, EP's decision to disallow overlapping rules) so that it may take advantage of EP's speed.
Dartmouth Digital Commons Citation
Rebelsky, Samuel A., "Incremental Equational Programming" (1994). Computer Science Technical Report PCS-TR94-240. https://digitalcommons.dartmouth.edu/cs_tr/108