recursive programming through table look-up
The maintenance of arbitrarily large tables of previously computed values for functions on integer domains becomes practical when those tables are built using cons tructor functions which suspend evaluation of their arguments. Two styles of programming with such tables are presented. The first results from replacing recursive invocations within standard recursive function definitions with a reference into a table which is predefined to be all the possible results of the function. The second, more sophisticated, style requires that the table be defined strictly through a generation scheme. In either case the table may be available to the user as a data structure exclusive of the function definition with entries still being manifested only when they are actually used.
recursion program tables maintenance values functional domain practical suspended evaluation evaluation argument standardization definition generation scheme case user data structures dynamic owns infinite lists streams lisp