Related papers: A tutorial on implementing De Morgan cubical type …
The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…
Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…
We introduce a family of copulas which are locally piecewise uniform in the interior of the unit cube of any given dimension. Within that family, the simultaneous control of tail dependencies of all projections to faces of the cube is…
Dependability is an umbrella concept that subsumes many key properties about a system, including reliability, maintainability, safety, availability, confidentiality, and integrity. Various dependability modeling techniques have been…
This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…
These expanded lecture notes are based on a tutorial on categorical proof theory presented at the summer school associated with the conference "Topology, Algebra, and Categories in Logic 2021-2022." The chapter delves into various…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
In this course we introduce the main notions relative to the classical theory of modular forms. A complete treatise in a similar style can be found in the author's book joint with F. Str{\"o}mberg [1].
This is a tutorial in applied and computational topology and topological data analysis. It is illustrated with numerous computational examples that utilize Gudhi library. It is under constant development, so please do not consider this…
This paper is a gentle introduction to some recent results involving the theory of gerbes over orbifolds for topologists, geometers and physicists. We introduce gerbes on manifolds, orbifolds, the Dixmier-Douady class, Beilinson-Deligne…
In this article we introduce the notion of a square structure on a model category, that generalises cubical model categories. We then show that under some homotopical conditions on this square structure the induced cubical category is a…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Bidirectional typing is a discipline in which the typing judgment is decomposed explicitly into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be…
We present guarded dependent type theory, gDTT, an extensional dependent type theory with a `later' modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to…
This is a study of twisted K-theory on a product space $T \times M$. The twisting comes from a decomposable cup product class which applies the 1-cohomology of $T$ and the 2-cohomology of $M$. In the case of a topological product, we give a…
This note documents the specification of normal forms in cubical type theory. The definition is already present in the proof of normalization for cubical type theory, but we present it in a more traditional style explicitly for reference.
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Several approaches exist to data-mining big corpora of formal proofs. Some of these approaches are based on statistical machine learning, and some -- on theory exploration. However, most are developed for either untyped or simply-typed…
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two characterizations of decomposable models in terms of independence…
These notes provide a quick introduction to the Coq system and show how it can be used to define logical concepts and functions and reason about them. It is designed as a tutorial, so that readers can quickly start their own experiments,…