Fine-Grain Incremental Implementation of Algebraic Specifications

摘要

Considering symbol tables as aggregate values often forms an obstacle toincremental type checking or evaluation of programs. A small change in a symbol table requires many expensive recalculations of values that depend on (part of) the symbol table. An incremental implementation was previously derived from algebraic specifications belonging to the subclass of well presented primitive recursive schemes. Type check specifications typically belong to this class. This incremental implementation method is generalized to functions on values of auxiliary data types like symbol tables. Thus, fine grain incremental implementations are obtained. This fine grain incrementality can be derived from a subclass of algebraic specifications called layered primitive recursive schemes.