1 citations · 3 across the 7 of their papers we have counts for
10 papers
Modal Logic for Distributed Trust
Niels Voorneveld, Peeter Laud
We propose a method for reasoning about trust in multi-agent systems, specifying a language for describing communication protocols and making trust assumptions and derivations. Thi…
A Simple Categorical Calculus of Interacting Processes
Chad Nester, Niels Voorneveld
We present a calculus that models a simple sort of process interaction. Our calculus consists of a collection of terms together with a rewrite relation, parameterised by an arbitra…
Parametric Iteration in Resource Theories
Alessandro Di Giorgio, Pawel Sobocinski, Niels Voorneveld
Many algorithms are specified with respect to a fixed but unspecified parameter. Examples of this are especially common in cryptography, where protocols often feature a security pa…
Dynamics and Coherence for the Free Cornering with Protocol Choice
Chad Nester, Niels Voorneveld
We present a term rewriting system that models the dynamic aspects of the free cornering with protocol choice of a monoidal category, which has been proposed as a categorical model…
Protocol Choice and Iteration for the Free Cornering
Chad Nester, Niels Voorneveld
We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated commu…
Inductive and Coinductive Predicate Liftings for Effectful Programs
Niccolò Veltri, Niels F. W. Voorneveld
We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution…
From Equations to Distinctions: Two Interpretations of Effectful Computations
Niels Voorneveld
There are several ways to define program equivalence for functional programs with algebraic effects. We consider two complementing ways to specify behavioural equivalence. One way…
Quantitative Logics for Equivalence of Effectful Programs
Niels Voorneveld
In order to reason about effects, we can define quantitative formulas to describe behavioural aspects of effectful programs. These formulas can for example express probabilities th…
Behavioural Equivalence via Modalities for Algebraic Effects
Alex Simpson, Niels Voorneveld
The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two pr…
Extensions of Scott's Graph Model and Kleene's Second Algebra
Jaap van Oosten, Niels Voorneveld
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to th…