Related papers: Formalisation in Constructive Type Theory of Baren…
Motivated by statistical practice, category theory terminology is used to introduce Borel data structures and study exchangeability in an abstract framework. A generalization of de Finetti's theorem is shown and natural transformations are…
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…
We establish the existence of the universal type structure in presence of conditioning events without any topological assumption, namely, a type structure that is terminal, belief-complete, and non-redundant, by performing a construction…
Consistent interactions that can be added to a two-dimensional, free abelian gauge theory comprising a special class of BF-type models and a collection of vector fields are constructed from the deformation of the solution to the master…
A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the lambda-calculus to include higher-order global state, probabilistic and non-deterministic choice, and input and output, while retaining confluence. The…
Several related operator-algebraic constructions for quantum field theory models on Minkowski spacetime are reviewed. The common theme of these constructions is that of a Borchers triple, capturing the structure of observables localized in…
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems…
Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normally, these structures are handled with destructive assignments…
The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…
We explore a wider theoretical framework that has quantum field theory built-in, taking the fact that quantum mechanics is reconstructed from quantum field theory as a hint. We formulate a quantum theory with an embedded structure by…
We introduce a novel framework consisting of a class of algebraic structures that generalize one-dimensional monoidal systems into higher dimensions by defining per-axis composition operators subject to non-commutativity and a global…
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…
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…
We show that the principal types of the closed terms of the affine fragment of $\lambda$-calculus, with respect to a simple type discipline, are structurally isomorphic to their interpretations, as partial involutions, in a natural Geometry…
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to…
The general notion of a Hausdorff-type operator with a kernel depending on an external variable is introduced and generalizations and analogs of classical results on the regularity of various summation methods are proved for the case of…
The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…