Related papers: Exceptionally Monadic Error Handling
We define two non-linear operations with random (not necessarily closed) sets in Banach space: the conditional core and the conditional convex hull. While the first is sublinear, the second one is superlinear (in the reverse set inclusion…
As part of the author's studies on equational reasoning for monadic programs, this report focus on non-determinism monad. We discuss what properties this monad should satisfy, what additional operators and notations can be introduced to…
Distributed applications often deal with data with different consistency requirements: while a post in a social network only requires weak consistency, the user balance in turn has strong correctness requirements, demanding mutations to be…
Truncated Toeplitz operators in a model space are C--symmetric with respect to a natural conjugation in that space. We show that this and another conjugation associated to an orthogonal decomposition possess unique properties and we study…
We study some dynamical properties of composition operators defined on the space $\mathcal{P}(^m X)$ of $m$-homogeneous polynomials on a Banach space $X$ when $\mathcal{P}(^m X)$ is endowed with two different topologies: the one of uniform…
In this note we consider weighted conditional type operators between different Orlicz spaces and generalized conditional type Holder inequality that we defined in [2]. Then we give some necessary and sufficient conditions for boundedness of…
Truncated Toeplitz operators are C--symmetric with respect to the canonical conjugation given on an appropriate model space. However, by considering only one conjugation one cannot characterize truncated Toeplitz operators. It will be…
The recently introduced notions of guarded traced (monoidal) category and guarded (pre-)iterative monad aim at unifying different instances of partial iteration whilst keeping in touch with the established theory of total iteration and…
This paper presents equational-based logics for proving first order properties of programming languages involving effects. We propose two dual inference system patterns that can be instanciated with monads or comonads in order to be used…
Incipient anomalies present milder symptoms compared to severe ones, and are more difficult to detect and diagnose due to their close resemblance to normal operating conditions. The lack of incipient anomaly examples in the training data…
In their work on second-order equational logic, Fiore and Hur have studied presentations of simply typed languages by generating binding constructions and equations among them. To each pair consisting of a binding signature and a set of…
Abstract dynamic programming models are used to analyze $\lambda$-policy iteration with randomization algorithms. Particularly, contractive models with infinite policies are considered and it is shown that well-posedness of the…
The paper is concerned with a free boundary problem generated by the biharmonic operator and an obstacle. The main goal is to deduce a fully guaranteed upper bound of the difference between the exact minimizer u and any function…
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…
Delimited continuations are the mother of all monads! So goes the slogan inspired by Filinski's 1994 paper, which showed that delimited continuations can implement any monadic effect, letting the programmer use an effect as easily as if it…
In modern programming languages, exception handling is an effective mechanism to avoid unexpected runtime errors. Thus, failing to catch and handle exceptions could lead to serious issues like system crashing, resource leaking, or negative…
Causal-consistent reversible debugging allows one to explore concurrent computations back and forth in order to locate the source of an error. In this setting, backward steps can be chosen freely as long as they are "causal consistent",…
Our main result is a recognition principle for iterated suspensions as coalgebras over the little disks operads. Given a topological operad, we construct a comonad in pointed topological spaces endowed with the wedge product. We then prove…
Undoing operations is an indispensable feature for many collaborative applications, mainly collaborative editors. It provides the ability to restore a correct state of shared data after erroneous operations. In particular, selective undo…
Shallow embeddings that use monads to represent effects are popular in proof-oriented languages because they are convenient for formal verification. Once shallowly embedded programs are verified, they are often extracted to mainstream…