Related papers: R\'esultats de compl\'etude pour des classes de ty…
We presente in this note a completeness result for the types with positive quantifiers of the J.-Y. Girard type system F. This result generalizes a theorem of R. Labib-Sami.
In 1990, J.L. Krivine introduced the notion of storage operator to simulate, in $\lambda$-calculus, the "call by value" in a context of a "call by name". J.L. Krivine has shown that, using G\"odel translation from classical into…
We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…
In 1990 J-L. Krivine introduced the notion of storage operators. They are $\lambda$-terms which simulate call-by-value in the call-by-name strategy and they can be used in order to modelize assignment instructions. J-L. Krivine has shown…
In 1990, J.L. Krivine introduced the notion of storage operator to simulate "call by value" in the "call by name" strategy. J.L. Krivine has shown that, using G\"odel translation of classical into intuitionitic logic, we can find a simple…
In this paper, we extend the system AF2 in order to have the subject reduction for the $\beta\eta$-reduction. We prove that the types with positive quantifiers are complete for models that are stable by weak-head expansion.
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
We develop an explicit algebriac de Rham theory for relative completion of $\mathrm{SL}_2(\mathbb{Z})$. This allows the construction of iterated integrals involving modular forms of the second kind, generalizing iterated integrals of…
We present an adaptation, based on program extraction in elementary linear logic, of Krivine & Leivant's system FA_2. This system allows to write higher-order equations in order to specify the computational content of extracted programs.…
We investigate the completeness of Gabor systems with respect to several classes of window functions on rational lattices. Our main results show that the time-frequency shifts of every finite linear combination of Hermite functions with…
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
On a complete Riemannian manifold M with Ricci curvature satisfying $$\textrm{Ric}(\nabla r,\nabla r) \geq -Ar^2(\log r)^2(\log(\log r))^2...(\log^{k}r)^2$$ for $r\gg 1$, where A>0 is a constant, and r is the distance from an arbitrarily…
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
The aim of this paper is to give a precise proof of the completeness of Lamb modes and associated modes. This proof is relatively simple and short but relies on two powerful mathematical theorems. The first one is a theorem on elliptic…
This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…
The method of realizability was first developed by Kleene and is seen as a way to extract computational content from mathematical proofs. Traditionally, these models only satisfy intuitionistic logic, however this method was extended by…
K. Mahler introduced the concept of perfect systems in the general theory he developed for the simultaneous Hermite-Pade approximation of analytic functions. We prove that Nikishin systems are perfect providing, by far, the largest class of…
We provide new equivalent conditions for an algebra $\Lambda$ to be $g$-finite, analogous to those established by L. Demonet, O. Iyama, and G. Jasso, but within the category of projective presentations $\mathcal{K}^{[-1,0]}(\text{proj}…
We give a congruence for L-functions coming from affine additive exponential sums over a finite field. Precisely, we give a congruence for certain operators coming from Dwork's theory. This congruence is very similar to the congruence of…
We introduce a notion of rank completion for bi-modules over a finite tracial von Neumann algebra. We show that the functor of rank completion is exact and that the category of complete modules is abelian with enough projective objects.…