A highly parallel model for object-oriented concurrent constraint programming

Two of the currently most promising programming paradigms, namely object-oriented programming and concurrent constraint programming are combined into a single, highly parallel computational model based on term graph rewriting systems. In particular, we show how multi-headed term graph rewrite rules provide a powerful tool able to manipulate term graphs which themselves represent in a homogeneous way objects, concurrently executing agents and constraints. Due to the inherent fine grain parallelism of term graph rewriting the proposed model is highly parallel with all activities (object communication, agent execution and constraint solving) executing concurrently