Related papers: Formalizing two-level type theory with cofibrant e…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper…
We present a constructive formalization of Abstract Rewriting Systems (ARS) in the Agda proof assistant, focusing on standard results in term rewriting. We define a taxonomy of concepts related to termination and confluence and investigate…
We introduce a universe of regular datatypes with variable binding information, for which we define generic formation and elimination (i.e. induction /recursion) operators. We then define a generic alpha-equivalence relation over the types…
The notion of type of a differential 2-form in four variables is introduced and for 2-forms of type < 4, local normal models are given. If the type of a 2-form $\Omega$ is 4, then the equivalence under diffeomorphisms of $\Omega$ is reduced…
This paper contains an elementary proof of the existence of the classical model structure on the category of unbounded DG-Lie algebras over a field of characteristic zero, with an emphasis on the properties of free and semifree extensions,…
We introduce a proof-theoretic approach to showing nondefinability of second-order intuitionistic connectives by quantifier-free schemata. We apply the method to prove that Taranovsky's "realizability disjunction" connective does not admit…
Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are correct. This burden can be shifted away from the user by providing a library of exact analysis in which the…
Type theories can be formalized using the intrinsically (hard) or the extrinsically (soft) typed style. In large libraries of type theoretical features, often both styles are present, which can lead to code duplication and integration…
We give a new formulation of Turing reducibility in terms of higher modalities, inspired by an embedding of the Turing degrees in the lattice of subtoposes of the effective topos discovered by Hyland. In this definition, higher modalities…
We study the 2-category of elements from an abstract point of view. We generalize to dimension 2 the well-known result that the category of elements can be captured by a comma object that also exhibits a pointwise left Kan extension. For…
In a recent paper, the second author and Joana Cirici proved a theorem that says that given appropriate hypotheses, $n$-formality of a differential graded algebraic structure is equivalent to the existence of a chain-level lift of a…
In functional programming languages, generalized algebraic data types (GADTs) are very useful as the unnecessary pattern matching over them can be ruled out by the failure of unification of type arguments. In dependent type systems, this is…
We define a new notion of an algebraic model structure, in which the cofibrations and fibrations are retracts of coalgebras for comonads and algebras for monads, and prove "algebraic" analogs of classical results. Using a modified version…
In dependently typed programming, proofs of basic, structural properties can be embedded implicitly into programs and do not need to be written explicitly. Besides saving the effort of writing separate proofs, a most distinguishing and…
The recently introduced dependent typed higher-order logic (DHOL) offers an interesting compromise between expressiveness and automation support. It sacrifices the decidability of its type system in order to significantly extend its…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
We prove an extensionality theorem for the "type-in-type" dependent type theory with Sigma-types. We suggest that the extensional equality type be identified with the logical equivalence relation on the free term model of type theory.
We study some formality criteria for differential graded algebras over differential graded operads. This unifies and generalizes other known approaches like the ones by Manetti and Kaledin. In particular, we construct general operadic…
We describe forms with non-Abelian charges. We avoid the use of theories with flat curvatures by working in the context of topological field theory. We obtain TQFTs for a form and its dual. We leave open the question of getting gauges in…