Related papers: A monad for full ground reference cells
Modular exponentiation is crucial to number theory and cryptography, yet remains largely unexplored from a mechanistic interpretability standpoint. We train a 4-layer encoder-decoder Transformer model to perform this operation and…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
Algebra and representation theory in modular tensor categories can be combined with tools from topological field theory to obtain a deeper understanding of rational conformal field theories in two dimensions: It allows us to establish the…
Let A be an algebra with a countable basis and let B be, say, a Frechet algebra that contains A as a dense subalgebra. This embedding induces a functor from the derived category of B-modules to the derived category of A-modules. In many…
For a generalisation of the classical theory of Hopf algebra over fields, A. Brugui\`eres and A. Virelizier study opmonoidal monads on monoidal categories (which they called {\em bimonads}). In a recent joint paper with S. Lack the same…
This paper extends Escardo and Oliva's selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell. The use of the closely related continuation monad transformer…
We give a commutative valuations monad Z on the category DCPO of dcpo's and Scott-continuous functions. Compared to the commutative valuations monads given in [Jia et al., 2021], our new monad Z is larger and it contains all push-forward…
If T is a commutative monad on a cartesian closed category, then there exists a natural T-bilinear pairing from T(X) times the space of T(1)-valued functions on X ("integration"), as well as a natural T-bilinear action on T(X) by the space…
We build, from the collection of all groups of unitriangular matrices, Hopf monoids in Joyal's category of species. Such structure is carried by the collection of class function spaces on those groups, and also by the collection of…
We introduce the abstract notions of "monadic operational semantics", a small-step semantics where computational effects are modularly modeled by a monad, and "type-and-effect system", including "effect types" whose interpretation lifts…
We outline the theory of reflections for prederivators, derivators and stable derivators. In order to parallel the classical theory valid for categories, we outline how reflections can be equivalently described as categories of fractions,…
The proposed method extends upon the representational output of semantic instance segmentation by explicitly including both visible and occluded parts. A fully convolutional network is trained to produce consistent pixel-level embedding…
We present our position on the elusive quest for a general-purpose framework for specifying and studying deep learning architectures. Our opinion is that the key attempts made so far lack a coherent bridge between specifying constraints…
Monads provide a simple and concise interface to user-defined computational effects in functional programming languages. This enables equational reasoning about effects, abstraction over monadic interfaces and the development of monad…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
In this paper, we generalize the principle of the Long-Moody construction for representations of braid groups to other groups, such as mapping class groups of surfaces. Namely, we introduce endofunctors over a functor category that encodes…
We show that the classifying space functor $B: Mon \to Top*$ from the category of topological monoids to the category of based spaces is left adjoint to the Moore loop space functor $\Omega': Top*\to Mon$ after we have localized $Mon$ with…
It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
Modern deep learning-based recommendation systems exploit hundreds to thousands of different categorical features, each with millions of different categories ranging from clicks to posts. To respect the natural diversity within the…