Related papers: Processes Parametrised by an Algebraic Theory
In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…
We provide estimates for the convolution product of an arbitrary number of "resurgent functions", that is holomorphic germs at the origin of $C$ that admit analytic continuation outside a closed discrete subset of $C$ which is stable under…
Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…
To formalize calculations in linear algebra for the development of efficient algorithms and a framework suitable for functional programming languages and faster parallelized computations, we adopt an approach that treats elements of linear…
We characterise slice-regularity of functions over a real alternative *-algebra using operators that arise in Dunkl operator theory. We present a unifying perspective on hypercomplex analysis by defining a family of function spaces in the…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…
Kleene algebras with tests (KATs) offer sound, complete, and decidable equational reasoning about regularly structured programs. Interest in KATs has increased greatly since NetKAT demonstrated how well extensions of KATs with…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
This paper shows how the use of Structural Operational Semantics (SOS) in the style popularized by the process-algebra community can lead to a more succinct and useful construction for building finite automata from regular expressions. Such…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
We extend the definition and construct several bases for polylogarithms Li T , where T are some series, recognizable by a finite state (multiplicity) automaton of alphabet 4 X = {x 0 , x 1 }. The kernel of this new "polylogarithmic map" Li…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
The process approach to NRQM offers a fourth framework for the quantization of physical systems. Unlike the standard approaches (Schrodinger-Heisenberg, Feynman, Wigner-Gronewald-Moyal), the process approach is not merely equivalent to NRQM…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put into the following abstract form: The input is a partial…
We establish elements of a new approch to ellipticity and parametrices within operator algebras on a manifold with higher singularities, only based on some general axiomatic requirements on parameter-dependent operators in suitable scales…
We propose algebraic protocols that enable the definition of protocol templates and session types analogous to the definition of domain-specific types with algebraic datatypes. Parameterized algebraic protocols subsume all regular as well…
We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the…