| Publication | Date of Publication | Type |
|---|
| Normalization properties of \lambda\mu-calculus using realizability semantics | 2023-11-07 | Paper |
Normalization in the simply typed -calculus
Mathematical Structures in Computer Science | 2023-04-27 | Paper |
Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus
AIMS Mathematics | 2022-04-25 | Paper |
| The mathematical proofs. Complete course with 127 solved exercises. With a preface by Gilles Dowek | 2018-10-05 | Paper |
Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus
Journal of Applied Non-Classical Logics | 2018-08-28 | Paper |
An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
(available as arXiv preprint) | 2018-08-15 | Paper |
A revised completeness result for the simply typed \(\lambda\mu\)-calculus using realizability semantics
(available as arXiv preprint) | 2017-10-12 | Paper |
Strong normalization of \(\lambda^{\mathrm{Sym}}_{\mathrm{Prop}}\)- and \(\overline{\lambda}\mu\overline{\mu}^\ast\)-calculi
(available as arXiv preprint) | 2017-10-12 | Paper |
About the range property for H
Logical Methods in Computer Science | 2014-01-22 | Paper |
| A semantics of realisability for the classical propositional natural deduction | 2013-10-02 | Paper |
A semantics of realisability for the classical propositional natural deduction
(available as arXiv preprint) | 2013-10-02 | Paper |
| Why the usual candidates of reducibility do not work for the symmetric -calculus | 2013-10-02 | Paper |
Why the usual candidates of reducibility do not work for the symmetric -calculus
(available as arXiv preprint) | 2013-10-02 | Paper |
On realisability semantics for intersection types with expansion variables
Fundamenta Informaticae | 2013-01-24 | Paper |
Strong normalization results by translation
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Classical combinatory logic
(available as arXiv preprint) | 2010-07-28 | Paper |
| Classical combinatory logic | 2010-07-28 | Paper |
Confluency property of the call-by-value \(\lambda\mu^{\wedge\vee}\)-calculus
(available as arXiv preprint) | 2010-07-28 | Paper |
| Confluency property of the call-by-value \(\lambda\mu^{\wedge\vee}\)-calculus | 2010-07-28 | Paper |
Complete types in an extension of the system \({\mathcal A}{\mathcal F}2\)
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
A completeness result for the simply typed \(\lambda \mu \)-calculus
Annals of Pure and Applied Logic | 2009-10-09 | Paper |
| Realisability Semantics for Intersection Types and Expansion Variables | 2009-05-13 | Paper |
| A short proof of the strong normalization of the simply typed \lambda\mu-calculus | 2009-05-11 | Paper |
| Parametric mixed sequent calculus | 2009-05-11 | Paper |
Storage operators and forall-positive types of system TTR
(available as arXiv preprint) | 2009-05-05 | Paper |
| La Valeur d'un Entier Classique en $\lambda\mu$-Calcul | 2009-05-05 | Paper |
| Une r\'eponse n\'egative \`a la conjecture de E. Tronci pour les syst\`emes num\'eriques typ\'es | 2009-05-05 | Paper |
| I-Types of System F | 2009-05-04 | Paper |
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
Lecture Notes in Computer Science | 2009-03-10 | Paper |
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Arithmetical proofs of strong normalization results for symmetric lambda calculi
(available as arXiv preprint) | 2007-07-20 | Paper |
A completeness result for a realisability semantics for an intersection type system
Annals of Pure and Applied Logic | 2007-05-23 | Paper |
A semantical proof of the strong normalization theorem for full propositional classical natural deduction
Archive for Mathematical Logic | 2006-03-22 | Paper |
Typed Lambda Calculi and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
A short proof of the strong normalization of classical natural deduction with disjunction
Journal of Symbolic Logic | 2005-02-09 | Paper |
A short proof of the strong normalization of classical natural deduction with disjunction
Journal of Symbolic Logic | 2005-02-09 | Paper |
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
Theoretical Computer Science | 2004-10-27 | Paper |
Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
(available as arXiv preprint) | 2002-11-13 | Paper |
The I-types of system F
RAIRO. Theoretical Informatics and Applications | 2002-04-29 | Paper |
The I-types of system F
RAIRO. Theoretical Informatics and Applications | 2002-04-29 | Paper |
Syntactical data types of system F
RAIRO. Theoretical Informatics and Applications | 2002-04-29 | Paper |
Syntactical data types of system F
RAIRO. Theoretical Informatics and Applications | 2002-04-29 | Paper |
Syntactical data types of system F
RAIRO. Theoretical Informatics and Applications | 2002-04-29 | Paper |
Mixed logic and storage operators
Archive for Mathematical Logic | 2000-07-09 | Paper |
On Storage Operators
(available as arXiv preprint) | 2000-02-15 | Paper |
A conjecture on numeral systems
Notre Dame Journal of Formal Logic | 1999-08-17 | Paper |
Un résultat de complétude pour les types ∀+ du système F
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 1999-01-24 | Paper |
A syntactical proof of the operational equivalence of two -terms
Theoretical Computer Science | 1998-07-22 | Paper |
Résultats de complétude pour des classes de types du système $\mathcal {AF}2$
RAIRO - Theoretical Informatics and Applications | 1998-05-24 | Paper |
Résultats de complétude pour des classes de types du système $\mathcal {AF}2$
RAIRO - Theoretical Informatics and Applications | 1998-05-24 | Paper |
Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés
RAIRO - Theoretical Informatics and Applications | 1998-05-24 | Paper |
S-Storage Operators
Mathematical Logic Quarterly | 1998-03-04 | Paper |
The value of a classical integer in \(\lambda \mu\)-calculus
Archive for Mathematical Logic | 1997-06-23 | Paper |
An example of a non adequate numeral system
(available as arXiv preprint) | 1997-06-15 | Paper |
Storage Operators and ∀‐positive Types in TTR Type System
Mathematical Logic Quarterly | 1996-12-05 | Paper |
Opérateurs de mise en mémoire et types \forall -positifs
RAIRO - Theoretical Informatics and Applications | 1996-12-01 | Paper |
Storage operators and directed lambda-calculus
Journal of Symbolic Logic | 1996-06-13 | Paper |
A General Type for Storage Operators
Mathematical Logic Quarterly | 1996-05-13 | Paper |
| scientific article; zbMATH DE number 837069 (Why is no real title available?) | 1996-02-13 | Paper |
Entiers intuitionnistes et entiers classiques en \lambda \, C-calcul
RAIRO - Theoretical Informatics and Applications | 1996-02-01 | Paper |
| scientific article; zbMATH DE number 810966 (Why is no real title available?) | 1996-01-30 | Paper |
Strong storage operators and data types
Archive for Mathematical Logic | 1995-08-10 | Paper |
| scientific article; zbMATH DE number 563671 (Why is no real title available?) | 1994-06-16 | Paper |
| scientific article; zbMATH DE number 458872 (Why is no real title available?) | 1994-01-09 | Paper |
