. L Systems are a mathematical formalism originally designed to model the biological growth of plants. They are based upon a parallel rewriting mechanism. We show in this paper that there exists an equivalence between the class of D0L Systems and a particular construction of programs in the 81/2 declarative data-parallel language. 1 Introduction 81/2 is a declarative data-parallel language aimed at the simulation of dynamical systems. Its main structure is the fabric which is a stream [1, 2, 3] of collections [4]. The stream aspect of the fabric is used to describe the time axis of the simulation whereas the collection aspect of the fabric describe the space axis of the simulation. Because of space restrictions, we will not detail the 81/...
AbstractA property typical to fastly growing parallel systems is discussed and studied in the framew...
Pushed by recent evolvements in the field of declarative networking and data-parallel computation, w...
The memory of a deque automaton is more general than a queue or two stacks; to avoid overgeneralizat...
. The main motivation of 81/2 is to develop a high-level language that supports the parallel simulat...
Many novel computer architectures like array and multiprocessors which achieve high performance thro...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
This work presents an approach to the linguistic treatment of concurrent systems which has three mai...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
Imperative programming languages were initially built for uniprocessor systems that evolved out of t...
Declarative parallel programming languages express and control parallelism at a high level of abstr...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
The class of parallel rewriting systems is considered in this work, and the interaction between two ...
This paper introduces a language, Epsilon, for the description of systems with concurrency, and pre...
AbstractA property typical to fastly growing parallel systems is discussed and studied in the framew...
Pushed by recent evolvements in the field of declarative networking and data-parallel computation, w...
The memory of a deque automaton is more general than a queue or two stacks; to avoid overgeneralizat...
. The main motivation of 81/2 is to develop a high-level language that supports the parallel simulat...
Many novel computer architectures like array and multiprocessors which achieve high performance thro...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
This work presents an approach to the linguistic treatment of concurrent systems which has three mai...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
Imperative programming languages were initially built for uniprocessor systems that evolved out of t...
Declarative parallel programming languages express and control parallelism at a high level of abstr...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
The class of parallel rewriting systems is considered in this work, and the interaction between two ...
This paper introduces a language, Epsilon, for the description of systems with concurrency, and pre...
AbstractA property typical to fastly growing parallel systems is discussed and studied in the framew...
Pushed by recent evolvements in the field of declarative networking and data-parallel computation, w...
The memory of a deque automaton is more general than a queue or two stacks; to avoid overgeneralizat...