Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are introduced and general operators which manipulate these are introduced and discussed. These include random, respectful recombination. The extended formalism is applied to various common representations and standard operators are analysed in the light of the formalism
A behavioural theory comprises a set of postulates that characterise a particular class of algorith...
We explore an algebraic language for networks consisting of a fixed number of reactive units, commun...
AbstractAn abstract definition of bisimulation is presented. It makes possible a uniform definition ...
A rigorous formulation of the generalisation of schema analysis known as forma analysis is presente...
The conventional understanding of genetic algorithms depends upon analysis by schemata and the notio...
We define a formal model for a class of recursive-parallel systems with specific invocation and sync...
We briefly present notions and results from three directions of research which use formal language t...
This paper is intended to give an overview of the formal techniques that have been developed to deal...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
A formalism is introduced for representing general mechanisms of syntax recombination in natural lan...
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its ade...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
We define a formal model for a class of recursive-parallel programs with specific invocation and syn...
AbstractWe propose orthomodular posets, algebraic models of quantum logic, as a formal tool in concu...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
A behavioural theory comprises a set of postulates that characterise a particular class of algorith...
We explore an algebraic language for networks consisting of a fixed number of reactive units, commun...
AbstractAn abstract definition of bisimulation is presented. It makes possible a uniform definition ...
A rigorous formulation of the generalisation of schema analysis known as forma analysis is presente...
The conventional understanding of genetic algorithms depends upon analysis by schemata and the notio...
We define a formal model for a class of recursive-parallel systems with specific invocation and sync...
We briefly present notions and results from three directions of research which use formal language t...
This paper is intended to give an overview of the formal techniques that have been developed to deal...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
A formalism is introduced for representing general mechanisms of syntax recombination in natural lan...
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its ade...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
We define a formal model for a class of recursive-parallel programs with specific invocation and syn...
AbstractWe propose orthomodular posets, algebraic models of quantum logic, as a formal tool in concu...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
A behavioural theory comprises a set of postulates that characterise a particular class of algorith...
We explore an algebraic language for networks consisting of a fixed number of reactive units, commun...
AbstractAn abstract definition of bisimulation is presented. It makes possible a uniform definition ...