Related papers: Right-Adjoints for Datalog Programs, and Homomorph…

Two adjoint functors can be seen as generalisations of the two functions within a Galois connection. If instead the adjoints are not generalised from functions, but from relations, then analogously the object of study becomes a more general…

We develop new techniques for constructing model structures from a given class of cofibrations, together with a class of fibrant objects and a choice of weak equivalences between them. As a special case, we obtain a more flexible version of…

The relational data model offers unrivaled rigor and precision in defining data structure and querying complex data. Yet the use of relational databases in scientific data pipelines is limited due to their perceived unwieldiness. We propose…

A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H…

We develop the theory dg algebras with enough idempotents and their dg modules and show their equivalence with that of small dg categories and their dg modules. We introduce the concept of dg adjunction and show that the classical covariant…

Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big…

Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…

Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…

For topological spaces $X$ and $Y$, a (not necessarily continuous) function $f:X \rightarrow Y$ naturally induces a functor from the category of closed subsets of $X$ (with morphisms given by inclusions) to the category of closed subsets of…

Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…

Incremental computation has recently been studied using the concepts of change structures and derivatives of programs, where the derivative of a function allows updating the output of the function based on a change to its input. We…

We give a new criterion guaranteeing existence of model structures left-induced along a functor admitting both adjoints. This works under the hypothesis that the functor induces idempotent adjunctions at the homotopy category level. As an…

There is some consensus among orthodox category theorists that the concept of adjoint functors is the most important concept contributed to mathematics by category theory. We give a heterodox treatment of adjoints using heteromorphisms…

Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow…

The aim of this article is to describe a new perspective on functoriality of persistent homology and explain its intrinsic symmetry that is often overlooked. A data set for us is a finite collection of functions, called measurements, with a…

Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex…

Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…

Let E be a (right) Hilbert C*-module over a C*-algebra A. If E is equipped with a left action of a second C*-algebra B, then tensor product with E gives rise to a functor from the category of Hilbert B-modules to the category of Hilbert…

Datalog is a popular logic programming language for deductive reasoning tasks in a wide array of applications, including business analytics, program analysis, and ontological reasoning. However, Datalog's restriction to flat facts over…

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…