Related papers: Type System for Four Delimited Control Operators
Hyponormal operators are known to be among the most difficult operators to analyze. In this work, we focus on two finite types of hyponormal operators. The first type becomes analytic shifts, while the second type admits analytic models. A…
We present an asynchronous calculus for multiparty sessions with mixed choice, which extends the Simple MultiParty Session framework in order to support nondeterministic choices with both input and output prefixes. Global types -- equipped…
We develop an operator-based framework to coarse-grain interacting particle systems that exhibit clustering dynamics. Starting from the particle-based transfer operator, we first construct a sequence of reduced representations: the operator…
Designing programming languages that enable intuitive and safe manipulation of data structures is a critical research challenge. Conventional destructive memory operations using pointers are complex and prone to errors. Existing type…
Many type systems have been presented in the literature for variants of the pi-calculus, but none of them are able to handle composite subjects such as those found in the language epi, which features polyadic synchronisation. The purpose of…
Overall, in any system, the proportional term, integral term, and derivative term combined to produce a fast response time, less overshoot, no oscillations, increased stability, and no steady-state errors. Eliminating the steady state…
Typestate-oriented programming is an extension of the OO paradigm in which objects are modeled not just in terms of interfaces but also in terms of their usage protocols, describing legal sequences of method calls, possibly depending on the…
We study a system of all-to-all weakly coupled uniformly expanding circle maps in the thermodynamic limit. The state of the system is described by a probability measure and its evolution is given by the action of a nonlinear operator, also…
We introduce a class of linear bounded invertible operators on Banach spaces, called shift operators, which comprises weighted backward shifts and models finite products of weighted backward shifts and dissipative composition operators. We…
We adapt the technique of type-generic programming via descriptions pointing into a universe to the domain of typed languages with binders and variables, implementing a notion of "syntax-generic programming" in a dependently typed…
We extend the scope of noncommutative geometry by generalizing the construction of the noncommutative algebra of a quotient space to situations in which one is no longer dealing with an equivalence relation. For these so-called tolerance…
An \textit{ideal} of $N$-tuples of operators is a class invariant with respect to unitary equivalence which contains direct sums of arbitrary collections of its members as well as their (reduced) parts. New decomposition theorems (with…
The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the…
In previous work of C. A. Tracy and the author asymptotic formulas were derived for certain operator determinants whose interest lay in the fact that quotients of them gave solutions to the cylindrical Toda equations. In the present paper…
There are several important abstract operator systems with the convex cone of positive semidefinite matrices at the first level. Well-known are the operator systems of separable matrices, of positive semidefinite matrices, and of block…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
Formal verification methods for concurrent systems cannot always be scaled-down or tailored in order to be applied on specific subsystems. We address such an issue in a MultiParty Session Types setting by devising a partial type assignment…
It was recently proved that in some special cases asymmetric truncated Toeplitz operators can be characterized in terms of compressed shifts and rank-two operators of special form. In this paper we show that such characterizations hold in…
We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…
In this paper, we present an explicit method to identify equivariant suboperads of coinduced operads that contain only fixed points associated to any desired transfer system. Our method works for a class of operads that we call intersection…