Related papers: Extensionality of lambda-*

For any ordinal \Lambda, we can define a polymodal logic GLP(\Lambda), with a modality [\xi] for each \xi<\Lambda. These represent provability predicates of increasing strength. Although GLP(\Lambda) has no Kripke models, Ignatiev showed…

Intersection types are an essential tool in the analysis of operational and denotational properties of lambda-terms and functional programs. Among them, non-idempotent intersection types provide precise quantitative information about the…

We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…

We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.

The purpose of this survey article is to introduce the reader to a connection between Logic, Geometry, and Algebra which has recently come to light in the form of an interpretation of the constructive type theory of Martin-L\"of into…

We study exponentiable functors in the context of synthetic $\infty$-categories. We do this within the framework of simplicial Homotopy Type Theory of Riehl and Shulman. Our main result characterizes exponentiable functors. In order to…

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of…

This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda…

Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…

In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…

For an abelian category $\mathcal{A}$, we establish the relation between its derived and extension dimensions. Then for an artin algebra $\Lambda$, we give the upper bounds of the extension dimension of $\Lambda$ in terms of the radical…

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…

This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…

We show how to derive (variants of) Michell truss theory in two and three dimensions rigorously as the vanishing weight limit of optimal design problems in linear elasticity in the sense of $\Gamma$-convergence. We improve our previous…

$\lambda$-self-expanders $\Sigma$ in $\mathbb{R}^{n+1}$ are the solutions of the isoperimetric problem with respect to the same weighted area form as in the study of the self-expanders. In this paper, we mainly extend the results on…

We introduce extensions by rules of the extensional level of the Minimalist Foundation which turn out to be equivalent to constructive and classical axiomatic set theories.