Related papers: Extensionality of lambda-*
Let $K:k$ be a field extension and let $\Lambda$ be a finite-dimensional $k$-algebra. We investigate the relationship between $\Lambda$ and $\Lambda_K = \Lambda \otimes_k K$ with particular emphasis on various aspects of $\tau$-tilting…
This work is devoted to dissipative extension theory for dissipative linear relations. We give a self-consistent theory of extensions by generalizing the theory on symmetric extensions of symmetric operators. Several results on the…
We present a construction of W-types in the setoid model of extensional Martin-L\"of type theory using dependent W-types in the underlying intensional theory. More precisely, we prove that the internal category of setoids has initial…
Lambda calculi with algebraic data types lie at the core of functional programming languages and proof assistants, but conceal at least two fundamental theoretical problems already in the presence of the simplest non-trivial data type, the…
In this paper we present a purely syntactical proof of the operational equivalence of $I=\lambda xx$ and the $\lambda$-term $J$ that is the $\eta$-infinite expansion of $I$.
We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo. This…
We study the relation of $L$-equivalence, which derives from the construction of the free locally convex spaces, through a concept that particularizes several notions related to the simultaneous extension of continuous functions. We also…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…
Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…
System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…
This paper presents a construction which transforms categorical models of additive-free propositional linear logic, closely based on de Paiva's dialectica categories and Oliva's functional interpretations of classical linear logic. The…
In recent work the author presented a formal expansion for lambda_d associated to the dimer problem on a d-dimensional rectangular lattice. Expressed in terms of d it yielded a presumed asymptotic expansion for lambda_d in inverse powers of…
We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…
We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…
We describe a non-extensional variant of Martin-L\"of type theory which we call two-dimensional type theory, and equip it with a sound and complete semantics valued in 2-categories.
Motivated by a question of Di Nasso, we prove that Hindman's theorem is equivalent to the existence of idempotent types in countable complete extensions of Peano Arithmetic.
We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…