100 citations
- Laboratoire de Mathématiques Blaise PascalFR36 papers
- Centre National de la Recherche ScientifiqueFR25 papers
- Université Savoie Mont BlancFR18 papers
- Université Paris-Est CréteilFR15 papers
- Institut de recherche mathématique de RennesFR4 papers
- Laboratoire de Probabilités et Modèles AléatoiresFR4 papers
- École Normale Supérieure de LyonFR3 papers
- Institut de Mathématiques de ToulouseFR3 papers
- Laboratoire de Mathématiques et Physique ThéoriqueFR3 papers
- University of ChileCL3 papers
- Center for Mathematical ModelingCL2 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR2 papers
33 papers · 1 filter
Strong normalization results by translation
René David, Karim Nour
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed…
A direct proof of the confluence of combinatory strong reduction
René David
I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for…
Realisability Semantics for Intersection Types and Expansion Variables
Fairouz Kamareddine, Karim Nour, Vincent Rahli +1
Expansion was invented at the end of the 1970s for calculating principal typings for -terms in type systems with intersection types. Expansion variables (E-variables) were inven…
A complete realisability semantics for intersection types and arbitrary expansion variables
Fairouz Kamareddine, Karim Nour, Vincent Rahli +1
Expansion was introduced at the end of the 1970s for calculating principal typings for -terms in intersection type systems. Expansion variables (E-variables) were introduced at…
Parametric mixed sequent calculus
Karim Nour, Olivier Laurent
In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a…
A short proof of the strong normalization of the simply typed -calculus
René David, Karim Nour
We give an elementary and purely arithmetical proof of the strong normalization of Parigot's simply typed -calculus.