
Diagrammatic Polyhedral Algebra
We extend the theory of Interacting Hopf algebras with an order primitiv...
read it

On sequentiality and wellbracketing in the πcalculus
The π calculus is used as a model for programminglanguages. Its context...
read it

The Benefit of Being NonLazy in Probabilistic λcalculus
We consider the probabilistic applicative bisimilarity (PAB), a coinduct...
read it

Interacting Hopf Algebras: the theory of linear systems
As first main contribution, this thesis characterises the PROP SVk of li...
read it

Structural Operational Semantics for Control Flow Graph Machines
Compilers use control flow graph (CFG) representations of lowlevel prog...
read it

On the Distributability of Mobile Ambients
Modern society is dependent on distributed software systems and to verif...
read it

On the Distributability of Mobile Ambients (Technical Report)
Modern society is dependent on distributed software systems and to verif...
read it
Contextual Equivalence for Signal Flow Graphs
We extend the signal flow calculus—a compositional account of the classical signal flow graph model of computation—to encompass affine behaviour, and furnish it with a novel operational semantics. The increased expressive power allows us to define a canonical notion of contextual equivalence, which we show to coincide with denotational equality. Finally, we characterise the realisable fragment of the calculus: those terms that express the computations of (affine) signal flow graphs.
READ FULL TEXT
Comments
There are no comments yet.