Extend program model by allowing general predicates on the recursive calls.

• ``If we do not want to restrict the form of such predicates, or allow them to be runtime dependent, follow the `fuzzy' approach, [CC96].''

This is an approach that needs to be taken, since we realistically need to deal with programs where certain information is only know at run-time. Certain more coarse grained parallelisation techniques, (e.g. function call parallelism, see [GHZ98]) do not need full dataflow information, however, so some dependency analysis can still be done.

• ``As with the Group Fields approach, predefine a subset of the potentially infinite structure for the program to operate on.''

• ``Use recursive constructs as in [CCG96] to build up a the structure first. The functions then only operate over the values that have been defined.''

The current approach is closer to the way that recursive structures in C are handled normally. The description allows the structure to be thought of as infinite, but an actual structure is bounded by NULL pointers. This allows structures of irregular shape and dynamically growing and shrinking structures to be included.