Catalogue of Artificial Intelligence Techniques

   

Jump to: Top | Entry | References | Comments

View Maths as: Images | MathML

Delayed Evaluation

Categories: Automatic Programming , Theorem Proving


Author(s): P.M.D. Gray

A technique for generating a piece of program as a sequence of instructions (or as a composition of functions) from a set of clauses which specify constraints on data items. The data items are represented by tokens, some of which are replaced by list structures representing `recipes' or promises to construct the given items from other items. The clauses are run through an interpreter using Data-directed Control which finds an execution path. Instead of evaluating the computed result directly, it builds up a composed function or recipe. This composed function can be used in various ways:

There is a connection with Least Commitment techniques, in that these, too, delay solution of a particular goal until sufficient constraints are available.


References:


Comments:

Add Comment

No comments.