Extraction and optimization of the implicit program parallelism by dynamic partial evaluation

Much work has been done to implement declarative languages in parallel form. Most of them tend to resort to imperative features for some purposes, particularly for description of the parallelism. We propose parallel computation on associative networks, a machine independent parallel programming model, for automatic extraction of available inherent parallelism and optimization of declarative programs. Associative networks are used for representing program-like and data-like information. The computation follows the transformation style of information processing. All computational mechanisms are oriented reward the processing incomplete information and perform parallel partial evaluation. This partial evaluation is a base of the proposed technique for automatic transforming, optimizing, and parallelizing declarative programs