Related papers: Binomial Tabulation: A Short Story
In this paper we give an algorithmic description of Freyd categories that subsumes and enhances the usual approach to finitely presented modules in computer algebra. The upshot is a constructive approach to finitely presented functors that…
Several types of dependencies have been proposed for the static analysis of existential rule ontologies, promising insights about computational properties and possible practical uses of a given set of rules, e.g., in ontology-based query…
Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…
Functional programming languages are particularly well-suited for building automated reasoning systems, since (among other reasons) a logical term is well modeled by an inductive type, traversing a term can be implemented generically as a…
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…
Copulas have now become ubiquitous statistical tools for describing, analysing and modelling dependence between random variables. Sklar's theorem, "the fundamental theorem of copulas", makes a clear distinction between the continuous case…
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a…
We develop a string-net construction of a modular functor whose algebraic input is a pivotal bicategory; this extends the standard construction based on a spherical fusion category. An essential ingredient in our construction is a graphical…
We construct the COpula Recursive Tree (CORT) estimator: a flexible, consistent, piecewise linear estimator of a copula, leveraging the patchwork copula formalization and various piecewise constant density estimators. While the patchwork…
A didactical survey of the foundations of Algorithmic Information Theory. These notes are short on motivation, history and background but introduce some of the main techniques and concepts of the field. The "manuscript" has been evolving…
Recursive distinctioning (RD) is a name coined by Joel Isaacson in his original patent document describing how fundamental patterns of process arise from the systematic application of operations of distinction and description upon…
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been…
A supervised learning algorithm searches over a set of functions $A \to B$ parametrised by a space $P$ to find the best approximation to some ideal function $f\colon A \to B$. It does this by taking examples $(a,f(a)) \in A\times B$, and…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
Let $G$ be a reductive group scheme over the $p$-adic integers, and let $\mu$ be a minuscule cocharacter for $G$. In the Hodge-type case, we construct a functor from nilpotent $(G,\mu)$-displays over $p$-nilpotent rings $R$ to formal…