Related papers: Exceptionally Monadic Error Handling
It is well-known that typical word embedding methods such as Word2Vec and GloVe have the property that the meaning can be composed by adding up the embeddings (additive compositionality). Several theories have been proposed to explain…
A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the category DCPO. In this paper we present three such monads and a general…
We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2)…
Operator learning offers a robust framework for approximating mappings between infinite-dimensional function spaces. It has also become a powerful tool for solving inverse problems in the computational sciences. This chapter surveys…
We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a…
Transactional events (TE) are an extension of Concurrent ML (CML), a programming model for synchronous message-passing. Prior work has focused on TE's formal semantics and its implementation. This paper considers programming idioms,…
In this paper, we study the following singular problem associated with mixed operators (the combination of the classical Laplace operator and the fractional Laplace operator) under mixed boundary conditions \begin{equation*} \label{1}…
Monads are well known to be equivalent to lax functors out of the terminal category. Morita contexts are here shown to be lax functors out of the chaotic category with two objects. This allows various aspects in the theory of Morita…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
Event log records all events that occur during the execution of business processes, so detecting and correcting anomalies in event log can provide reliable guarantee for subsequent process analysis. The previous works mainly include next…
We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad…
Bidirectional transformations (bx) support principled consistency maintenance between data sources. Each data source corresponds to one perspective on a composite system, manifested by operations to 'get' and 'set' a view of the whole from…
The present paper shows meta-programming turn programming, which is rich enough to express arbitrary arithmetic computations. We demonstrate a type system that implements Peano arithmetics, slightly generalized to negative numbers. Certain…
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…
We will investigate the norm closure of the unitary and similarity orbits of normal operators in unital, simple, purely infinite C*-algebras. An operator theoretic proof will be given to the classification of when two normal operators are…
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…
We introduce a new two-sided type system for verifying the correctness and incorrectness of functional programs with atoms and pattern matching. A key idea in the work is that types should range over sets of normal forms, rather than sets…
In this paper we give characterizations of essential left ideals of a C*-algebra $A$ in terms of their properties as operator $A$-modules. Conversely, we seek C*-algebraic characterizations of those ideals $J$ in $A$ such that $A$ is an…
We give an order-theoretic characterization of the essential image of the forgetful functor from the category of real/complex unital C*-algebras to the category of real/complex unital operator systems. It is based on the characterization of…
This paper is devoted to the study of typical properties (in the Baire Category sense) of certain classes of continuous linear operators acting on Fr\'echet algebras, endowed with the topology of pointwise convergence. Our main results show…