相关论文: No value restriction is needed for algebraic effec…
We show that several convolution operators on the space of entire functions, such as the MacLane operator, support a dense hypercyclic algebra that is not finitely generated. Birkhoff's operator also has this property on the space of…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
Our basic structure is a finite-dimensional complex Hilbert space $H$. We point out that the set of effects on $H$ form a convex effect algebra. Although the set of operators on $H$ also form a convex effect algebra, they have a more…
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each "scalar" is a vector of parameters defining a circulant. This…
The algebraic approach to operator perturbation method has been applied to two quantum--mechanical systems ``The Stark Effect in the Harmonic Oscillator'' and ``The Generalized Zeeman Effect''. To that end, two realizations of the…
We show how direct integration can be used to solve the closed amplitudes of multi-cut matrix models with polynomial potentials. In the case of the cubic matrix model, we give explicit expressions for the ring of non-holomorphic modular…
Shapley effects are attracting increasing attention as sensitivity measures. When the value function is the conditional variance, they account for the individual and higher order effects of a model input. They are also well defined under…
We introduce a class of monotone $\sigma$-complete effect algebras, called representable, which are $\sigma$-homomorphic images of a class of monotone $\sigma$-complete effect algebras of functions taking values in the interval $[0,1]$ and…
One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
In this work we present a coupled-cluster theory for the propagation of multireference electronic systems initiating at general quantum mechanical states. Our formalism is based on the infinitesimal analysis of modified cluster operators,…
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in…
We provide a sound and relatively complete Hoare-like proof system for reasoning about partial correctness of recursive procedures in presence of local variables and the call-by-value parameter mechanism, and in which the correctness proofs…
We show that recent approaches of static analysis based on quantitative typing systems can be extended to programming languages with global state. More precisely, we define a call-by-value language equipped with operations to access a…
The good properties of Plotkin's call-by-value lambda-calculus crucially rely on the restriction to weak evaluation and closed terms. Open call-by-value is the more general setting where evaluation is weak but terms may be open. Such an…
We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice…
We characterize symbolic powers of prime ideals in polynomial rings over any field in terms of $\mathbb{Z}$-linear differential operators, and of prime ideals in polynomial rings over complete discrete valuation rings with a $p$-derivation…
Eigenvalues are defined for any element of an algebra of observables and do not require a representation in terms of wave functions or density matrices. A systematic algebraic derivation based on moments is presented here for the harmonic…
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are…