Related papers: Formalisation in Constructive Type Theory of Baren…
Since Val Tannen's pioneer work on the combination of simply-typed lambda-calculus and first-order rewriting (LICS'88), many authors have contributed to this subject by extending it to richer typed lambda-calculi and rewriting paradigms,…
We discuss some applications of fusion rules and intertwining operators in the representation theory of cyclic orbifolds of the triplet vertex operator algebra. We prove that the classification of irreducible modules for the orbifold vertex…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
We define an extension of the simply-typed lambda calculus where two different binding mechanisms, by position and by name, nicely coexist. In the former, as in standard lambda calculus, the matching between parameter and argument is done…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
Type theory can be described as a generalised algebraic theory. This automatically gives a notion of model and the existence of the syntax as the initial model, which is a quotient inductive-inductive type. Algebraic definitions of type…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to…
For a commutative ring $A$, we have the category of (bounded-below) chain complexes of $A$-modules $Ch_{+}(A\mymod)$, a closed symmetric monoidal category with a compatible stable Quillen model structure. The associated homotopy category is…
This work proposes a dependent type theory that combines functions and session-typed processes (with value dependencies) through a contextual monad, internalising typed processes in a dependently-typed lambda-calculus. The proposed…
We consider new concepts of entropy and pressure for stationary systems acting on density matrices which generalize the usual ones in Ergodic Theory. Part of our work is to justify why the definitions and results we describe here are…
In BV formalism we can consider a Lagrangian submanifold as a gauge condition. Starting with the BV action functional we construct a closed form on the space of Lagrangian submanifolds. If the action functional is invariant with respect to…
This papers is concerned with multisymplectic formalisms which are the frameworks for Hamiltonian theories for fields theory. Our main purpose is to study the observable $(n-1)$-forms which allows one to construct observable functionals on…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
We establish and advocate for a novel branch of category theory, centered around strong dinatural transformations (herein known as "paranatural transformations"). Paranatural transformations generalize natural transformations to…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
We introduce the structural resource lambda-calculus, a new formalism in which strongly normalizing terms of the lambda-calculus can naturally be represented, and at the same time any type derivation can be internally rewritten to its…
This paper gives a new and direct construction of the multi-prime big de Rham-Witt complex which is defined for every commutative and unital ring; the original construction by the author and Madsen relied on the adjoint functor theorem and…
For a terminal alphabet $\Sigma$ and an attribute alphabet $\Gamma$, a $(\Sigma, \Gamma)$-extractor is a function that maps every string over $\Sigma$ to a table with a column per attribute and with sets of positions of $w$ as cell entries.…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…