A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation

Tabled evaluation has proved to be all effective method to improve several aspect's of goal-oriented query evaluation, including termination and complexity. "Native" implementations of tabled evaluation offer good performance, but also require significant implementation effort! affecting compiler and abstract machine. Alternatively, program implementations. such its the original continuation call (CCall) technique, offer lower implementation burden at some efficiency cost. A limitation of the original CCall proposal is that it limits be interleaving of tabled and non-tabled predicates and thus cannot be used for arbitrary programs. In so work we present an extension of the Mall techniques that allows the execution of arbitrary tabled programs, as well as some performance results. Our approach offers it useful trade-off that can be competitive with state-of-the-art We keeping implementation effort relatively low.