Related papers: A Calculus for Scoped Effects & Handlers
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended…
This paper provides a new categorification of the Lebesgue integral with variable upper limits by using normed modules over finite-dimensional $\Bbbk$-algebras $\mathit{\Lambda}$ and the category $\mathscr{A}^p_{\mathit{\Lambda}}$…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and concurrent calculi; it is governed by type systems that…
A pseudodifferential calculus for parameter-dependent operators on smooth manifolds with boundary in the spirit of Boutet de Monvel's algebra is constructed. The calculus contains, in particular, the resolvents of realizations of…
Harmonic and polyanalytic functional calculi have been recently defined for bounded commuting operators. Their definitions are based on the Cauchy formula of slice hyperholomorphic functions and on the factorization of the Laplace operator…
Partial Combinatory Algebras (PCAs) provide a foundational model of the untyped $\lambda$-calculus and serve as the basis for many notions of computability, such as realizability theory. However, PCAs support a very limited notion of…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
Extending the work of Freese and Cook, which develop the basic theory of calculus and power series over real associative algebras, we examine what can be said about the logarithmic functions over an algebra. In particular, we find that for…
We present a calculus, called the scheme-calculus, that permits to express natural deduction proofs in various theories. Unlike $\lambda$-calculus, the syntax of this calculus sticks closely to the syntax of proofs, in particular, no names…
In the multicentric calculus one takes a polynomial with simple roots as a new global variable and replaces scalar functions {\varphi} by functions f taking values in C^d with d the degree of the polynomial leading to an efficient…
This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular…
Sequential effect systems are a class of effect system that exploits information about program order, rather than discarding it as traditional commutative effect systems do. This extra expressive power allows effect systems to reason about…
Rigorous modelling of natural and industrial systems still conveys various challenges related to abstractions, methods to proceed with and easy-to-use tools to build, compose and reason on models. Operads are mathematical structures that…
Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…
Logic programs, more specifically, Answer-set programs, can be annotated with probabilities on facts to express uncertainty. We address the problem of propagating weight annotations on facts (eg probabilities) of an ASP to its standard…
The purpose of this paper is to develop the theory of holomorphic functions with modulus bounded by $1$ on the symmetrized skew bidisc \[ \mathbb{G}_{r} \stackrel{\rm def}{=} \Big\{( \lambda_{1}+r\lambda_{2} ,r\lambda_{1}\lambda_{2}):…
There exist many techniques for automatically deriving parametric resource (or cost) bounds by analyzing the source code of a program. These techniques work effectively for a large class of programs and language features. However, non-local…
We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…
We introduce a class of (tuples of commuting) unbounded operators on a Banach space, admitting smooth functional calculi, that contains all operators of Helffer-Sj\"ostrand type and is closed under the action of smooth proper mappings.…