Related papers: Type System for Four Delimited Control Operators
We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…
In this paper, we analyze the constraints imposed by unitarity and crossing symmetry on conformal theories in large dimensions. In particular, we show that in a unitary conformal theory in large dimension $D$, the four-point function of…
A new set of projection operators for three-dimensional models are constructed. Using these operators, an uncomplicated and easily handling algorithm for analysing the unitarity of the aforementioned systems is built up. Interestingly…
Gradual typing is an approach to integrating static and dynamic typing within the same language, and puts the programmer in control of which regions of code are type checked at compile-time and which are type checked at run-time. In this…
Starting from an arbitrary endomorphism $\alpha$ of a unital C*-algebra $A$ we construct a bigger C*-algebra $B$ and extend $\alpha$ onto $B$ in such a way that the extended endomorphism $\alpha$ has a unital kernel and a hereditary range,…
We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…
We propose a hybrid process calculus for modelling and reasoning on cyber-physical systems (CPS{s}). The dynamics of the calculus is expressed in terms of a labelled transition system in the SOS style of Plotkin. This is used to define a…
We present the type 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…
We present a type system to guarantee termination of pi-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our…
Adjustable autonomy refers to entities dynamically varying their own autonomy, transferring decision-making control to other entities (typically agents transferring control to human users) in key situations. Determining whether and when…
The pentablock, denoted as $\cP,$ is defined as follows: $$\cP= \left\{ (a_{21}, {\rm tr}(A), {\rm det}(A)) : A = [a_{ij}]_{2 \times 2} \text{ with } \|A\|<1 \right\}.$$ It originated from the work of Agler--Lykova--Young in connection with…
We are interested in the evolution operators defined on commutative and nonassociative algebras when the scalar field is of characteristic 2. We distinguish four types: nilpotent, quasi-constant, ultimately periodic and plenary train…
We propose CASPER (ChAt, Shift and PERform), a novel dialog system consisting of three types of dialog models: chatter, shifter, and performer. Shifter, which is designed for topic switching, enables a seamless flow of dialog from…
The Koopman operator allows for handling nonlinear systems through a (globally) linear representation. In general, the operator is infinite-dimensional - necessitating finite approximations - for which there is no overarching framework.…
A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence,…
The aim of this paper is to correct a mistake in earlier work on the conformal invariance of Rarita-Schwinger operators and use the method of correction to develop properties of some conformally invariant operators in the Rarita-Schwinger…
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
Topological collections allow to consider uniformly many data structures in programming languages and are handled by functions defined by pattern matching called transformations. We present two type systems for languages with topological…
Collaborative problem solving (CPS) enables student groups to complete learning tasks, construct knowledge, and solve problems. Previous research has argued the importance to examine the complexity of CPS, including its multimodality,…