Related papers: Structural Rules and Algebraic Properties of Inter…
In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
We introduce integral structure types as a categorical analogue of virtual combinatorial species. Integral structure types then categorify power series with possibly negative coefficients in the same way that combinatorial species…
We define and study analogues of exponentials for functions on noncommutative two-tori that depend on a choice of a complex structure. The major difference with the commutative case is that our noncommutative exponentials can be defined…
We define and study the theory of derivation-based connections on a recently introduced class of bimodules over an algebra which reduces to the category of modules whenever the algebra is commutative. This theory contains, in particular, a…
We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We consider aspects of the noncommutative approach to the standard model based on the spectral action principle. We show that as a consequence of the incorporation of the Clifford structures in the formalism, the spectral action contains an…
We introduce a new representation of non-idempotent intersection types, using \textbf{sequences} (families indexed with natural numbers) instead of lists or multisets. This allows scaling up \textbf{intersection type} theory to the…
We propose applying the categorical compositional scheme of [6] to conceptual space models of cognition. In order to do this we introduce the category of convex relations as a new setting for categorical compositional semantics, emphasizing…
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…
In this thesis, a detailed study shows that closed itemsets and minimal generators play a key role for concisely representing both frequent itemsets and association rules. These itemsets structure the search space into equivalence classes…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\lambda$-term corresponds to some property…
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links…
The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
The Blackboard Architecture provides a mechanism for embodying data, decision making and actuation. Its versatility has been demonstrated across a wide number of application areas. However, it lacks the capability to directly model…
We present a general rule determining how extremal branes can interesect in a configuration with zero binding energy. The rule is derived in a model independent way and in arbitrary spacetime dimensions $D$ by solving the equations of…
In this paper, we provide constructions to enumerate large numbers of CI-liaison classes. To this end, we introduce a liaison invariant and prove several results concerning it, notably that it commutes with hypersurface sections. This…
This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…