Related papers: Strictification of weakly stable type-theoretic st…

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

This paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The…

The perturbation theory based on typicality introduced in Ref. [1] and further refined in Refs. [2, 3] provides a powerful tool since it is intended to be applicable to a wide range of scenarios while relying only on a few parameters. Even…

Concurrent accesses to databases are typically encapsulated in transactions in order to enable isolation from other concurrent computations and resilience to failures. Modern databases provide transactions with various semantics…

We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Gambino and Garner proved that the syntactic category of a dependent type theory with identity types can be endowed with a weak factorization system structure, called identity type weak factorization system. In this paper we consider an…

Harnessing the power of dependently typed languages can be difficult. Programmers must manually construct proofs to produce well-typed programs, which is not an easy task. In particular, migrating code to these languages is challenging.…

The weak-strong uniqueness of solutions to a broad class of cross-diffusion systems with volume filling is established. In general, the diffusion matrices are neither symmetric nor positive definite. This issue is overcome by supposing that…

An interesting observation is that most pairs of weakly homogeneous mappings have no strongly monotonic property, which is one of the key conditions to ensure the unique solvability of the generalized variational inequality. This paper…

Lumsdaine (2010) and van den Berg-Garner (2011) proved that types in Martin-L\"of type theory carry the structure of weak {\omega}-groupoids. Their proofs, while foundational, rely on abstract properties of the identity type without…

We construct two new one-parameter families of monotonicity formulas to study the free boundary points in the lower dimensional obstacle problem. The first one is a family of Weiss type formulas geared for points of any given homogeneity…

In this paper we study a model structure on a category of schemes with a group action and the resulting unstable and stable equivariant motivic homotopy theories. The new model structure introduced here samples a comparison to the one by…

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

We describe the development of a logic for reasoning about specifications in the Edinburgh Logical Framework (LF). In this logic, typing judgments in LF serve as atomic formulas, and quantification is permitted over contexts and terms that…

This paper presents an approach to Prolog-style term encoding of typed feature structures. The type feature structures to be encoded are constrained by appropriateness conditions as in Carpenter's ALE system. But unlike ALE, we impose a…

We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…