* This work has been carried out in the framework of the Spanish CICYT project TIC94-0930-C02-01. In this paper, we present a new coordination model and a small set of programming notations for distributed programming that can be integrated in very different programming languages (imperative, declarative or object oriented). Both together, allow the development of distributed programs in a compositional way, by assembling different independent pieces of (possibly preexisting and heterogeneous) code. This approach is in the spirit of many other similar proposals as Linda, PCN, CC++, etc., but it allows multiparadigm and multilingual integration and provides a powerful set of concurrent programming techniques, inherited from Concurrent Logic ...
none3Building on the success of the thirtheen previous editions (1998-2011), a special track on coor...
AbstractSeveral styles and notations for representing concurrent programs are shortly explained and ...
We define a practical algorithm for distributed rational tree unification and prove its correctness ...
In this paper, we present a new coordination model and a small set of programming notations for dist...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
The principle behind concurrent logic programming is a set of processes which co-operate in monotoni...
The aim of the present paper is to propose a model to coordinate agents running in heterogeneous pro...
. Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programm...
A description is given of language constructs for specifying concurrency in CDL*. The main goals in ...
AbstractWe propose a framework of distributed concurrent linear logic programming, which can elegant...
A new language concept for high-level distributed programming is proposed. Programs are organised as...
Massively parallel and distributed systems open new horizons for large applications and present new ...
Much progress has been made in distributed computing in the areas of distribution structure, open co...
none3Building on the success of the twelfth previous editions (1998-2010), a special track on coordi...
A new language concept for high-level distributed programming is proposed. Programs are organised as...
none3Building on the success of the thirtheen previous editions (1998-2011), a special track on coor...
AbstractSeveral styles and notations for representing concurrent programs are shortly explained and ...
We define a practical algorithm for distributed rational tree unification and prove its correctness ...
In this paper, we present a new coordination model and a small set of programming notations for dist...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
The principle behind concurrent logic programming is a set of processes which co-operate in monotoni...
The aim of the present paper is to propose a model to coordinate agents running in heterogeneous pro...
. Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programm...
A description is given of language constructs for specifying concurrency in CDL*. The main goals in ...
AbstractWe propose a framework of distributed concurrent linear logic programming, which can elegant...
A new language concept for high-level distributed programming is proposed. Programs are organised as...
Massively parallel and distributed systems open new horizons for large applications and present new ...
Much progress has been made in distributed computing in the areas of distribution structure, open co...
none3Building on the success of the twelfth previous editions (1998-2010), a special track on coordi...
A new language concept for high-level distributed programming is proposed. Programs are organised as...
none3Building on the success of the thirtheen previous editions (1998-2011), a special track on coor...
AbstractSeveral styles and notations for representing concurrent programs are shortly explained and ...
We define a practical algorithm for distributed rational tree unification and prove its correctness ...