We give an analysis of the non-constructivity of the following basic result: if X and Y are
simplicial sets and Y has the Kan extension property, then Y^ X also has the Kan extension …

We study Milner's lambda-calculus with partial substitutions. Particularly, we show
confluence on terms and metaterms, preservation of\b {eta}-strong normalisation and …

LNCS 3461 - Completeness Theorems and <TEX>$\lambda$</TEX>-Calculus Page 1
Completeness Theorems and λ-Calculus Thierry Coquand Institutionen för Datavetenskap …

We give a proof for the strong normalization result in the intersection type discipline, which
we obtain by putting together some well-known results and proof techniques. Our proof uses …

This paper is part of a general programme of treating explicit substitutions as the primary λ-
calculi from the point of view of foundations as well as applications. We work in a …

We develop a formalism for abstract interpretation based on logical relations. As a case
study, we use this formalism to give new proofs of correctness for strictness analysis on the …

Although we were careful in our\Background and Motivation" section to specify that we were
discussing-SN proofs for type systems more powerful than the simply-typed-calculus, the …

We present two new proofs of Simon Henry's result that the category of simplicial sets admits
a constructive counterpart of the classical Kan–Quillen model structure. Our proofs are …

A Kripke model for simplicial sets - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

In the folklore of linear logic, a common intuition is that the structure of finiteness spaces,
introduced by Ehrhard, semantically reflects the strong normalization property of cut …