DeepAI
Log In Sign Up

Contextual Equivalence for Signal Flow Graphs

02/20/2020
by   Filippo Bonchi, et al.
0

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

page 1

page 2

page 3

page 4

02/07/2022

Eager Functions as Processes (long version)

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...
05/23/2021

Diagrammatic Polyhedral Algebra

We extend the theory of Interacting Hopf algebras with an order primitiv...
12/06/2021

Eager Functions as Processes

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...
04/22/2021

On sequentiality and well-bracketing in the π-calculus

The π -calculus is used as a model for programminglanguages. Its context...
04/27/2020

The Benefit of Being Non-Lazy in Probabilistic λ-calculus

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...
02/12/2021

ReLU Neural Networks for Exact Maximum Flow Computation

Understanding the great empirical success of artificial neural networks ...
05/04/2018

Interacting Hopf Algebras: the theory of linear systems

As first main contribution, this thesis characterises the PROP SVk of li...