English
Related papers

Related papers: No value restriction is needed for algebraic effec…

200 papers

Studies on time and memory costs of products in geometric algebra have been limited to cases where multivectors with multiple grades have only non-zero elements. This allows to design efficient algorithms for a generic purpose; however, it…

Data Structures and Algorithms · Computer Science 2020-02-27 Stephane Breuils , Vincent Nozick , Akihiro Sugimoto

Effectful programs interact in ways that go beyond simple input-output, making compositional reasoning challenging. Existing work has shown that when such programs are ``separate'', i.e., when programs do not interfere with each other, it…

Programming Languages · Computer Science 2023-03-06 Pedro H. Azevedo de Amorim , Justin Hsu

Extending Mart\'in Escard\'o's effectful forcing technique, we give a new proof of a well-known result: Brouwer's monotone bar theorem holds for any bar that can be realized by a functional of type $(\mathbb{N} \to \mathbb{N}) \to…

Logic · Mathematics 2022-02-23 Jonathan Sterling

By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite…

Quantum Physics · Physics 2012-01-04 M. El Baz , R. Fresneda , J. P. Gazeau , Y. Hassouni

We study the expressive power of the LARA language -- a recently proposed unified model for expressing relational and linear algebra operations -- both in terms of traditional database query languages and some analytic tasks often performed…

Databases · Computer Science 2019-09-27 Pablo Barceló , Nelson Higuera , Jorge Pérez , Bernardo Subercaseaux

Functional data analysis in a mixed-effects model framework is done using operator calculus. In this approach the functional parameters are treated as serially correlated effects giving an alternative to the penalized likelihood approach,…

Statistics Theory · Mathematics 2013-01-22 Bo Markussen

We consider prescriptive type systems for logic programs (as in Goedel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then all derivations starting in a…

Logic in Computer Science · Computer Science 2007-05-23 Pierre Deransart , Jan-Georg Smaus

We consider a region of Minkowski spacetime bounded either by one or by two parallel, infinitely extended plates orthogonal to a spatial direction and a real Klein-Gordon field satisfying Dirichlet boundary conditions. We quantize these two…

Mathematical Physics · Physics 2015-10-01 Claudio Dappiaggi , Gabriele Nosari , Nicola Pinamonti

In this paper, we review the theory of time space-harmonic polynomials developed by using a symbolic device known in the literature as the classical umbral calculus. The advantage of this symbolic tool is twofold. First a moment…

Probability · Mathematics 2013-04-02 E. Di Nardo

A ring with effects (e-ring) is a generalization of the ring of bounded linear operators on a Hilbert space and the subsystem of effect operators (positive Hermitian operators dominated by the identity operator). The POV-measures…

Quantum Physics · Physics 2007-05-23 D. J. Foulis

Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind:…

Programming Languages · Computer Science 2017-11-09 Jean-Philippe Bernardy , Mathieu Boespflug , Ryan R. Newton , Simon Peyton Jones , Arnaud Spiwack

We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…

Programming Languages · Computer Science 2024-01-24 Francesco Gavazzo , Riccardo Treglia , Gabriele Vanoni

We describe a nonlinear generalization of dual dynamic programming theory and its application to value function estimation for deterministic control problems over continuous state and action spaces, in a discrete-time infinite horizon…

Optimization and Control · Mathematics 2018-10-05 Joseph Warrington , Paul N. Beuchat , John Lygeros

We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…

Logic · Mathematics 2017-09-29 Matthew Harrison-Trainor

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…

Logic in Computer Science · Computer Science 2019-08-15 Lê Thành Dũng Nguyen

Learning representations for pixel-based control has garnered significant attention recently in reinforcement learning. A wide range of methods have been proposed to enable efficient learning, leading to sample complexities similar to those…

Machine Learning · Computer Science 2021-11-16 Manan Tomar , Utkarsh A. Mishra , Amy Zhang , Matthew E. Taylor

We show how an effect algebra $\mathcal{X}$ can be regarded as a category, where the morphisms $x \rightarrow y$ are the elements $f$ such that $x \leq f \leq y$. This gives an embedding $\mathbf{EA} \rightarrow \mathbf{Cat}$. The interval…

Logic in Computer Science · Computer Science 2025-10-08 Lorenzo Perticone , Robin Adams

The selection monad on a set consists of selection functions. These select an element from the set, based on a loss (dually, reward) function giving the loss resulting from a choice of an element. Abadi and Plotkin used the monad to model a…

Programming Languages · Computer Science 2025-04-08 Gordon Plotkin , Ningning Xie

Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more…

General Mathematics · Mathematics 2016-12-28 Aleks Kleyn
‹ Prev 1 8 9 10 Next ›