Higher-dimensional dependent type theory enriches conventional one-dimensional
dependent type theory with additional structure expressing equivalence of elements of a …

We present a way of formalizing the intensional identity type based on the notion of
computational paths which will be taken to be proofs of propositional equality, and thus …

As a celebration of the Tractatus 100th anniversary it might be worth revisiting its relation to
the later writings. From the former to the latter, David Pears recalls that “everyone is aware of …

An appropriate framework is put forward for the construction of λ-models with∞-groupoid
structure, which we call homotopic λ-models, through the use of an∞-category with …

In order to get $\lambda $-models with a rich structure of $\infty $-groupoid, which we call"
homotopy $\lambda $-models", a general technique is described for solving domain …

One takes advantage of some basic properties of every homotopic\(\lambda\)-model (eg
extensional Kan complex) to explore the higher\(\beta\eta\)-conversions, which would …

We use a labelled deduction system based on the concept of computational paths
(sequences of rewrites) as equalities between two terms of the same type. We also define a …

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic
structure known asidentity type'. The idea is that, given terms $ a, b $ of a type $ A $, one …

On the basis of a labelled deduction system (LND TRS), we demonstrate how to formalize
the concept of computational paths (sequences of rewrites) as equalities between two terms …

In this work, we use a labelled deduction system based on the concept of computational
paths (sequence of rewrites) as equalities between two terms of the same type. We also …