Introduction à la logique: théorie de la démonstration: cours et exercices corrigés R David, K Nour, C Raffalli
(No Title), 2001
88 2001 A short proof of the strong normalization of classical natural deduction with disjunction R David, K Nour
The Journal of Symbolic Logic 68 (4), 1277-1288, 2003
41 2003 Opérateurs de mise en mémoire en lambda-calcul pur et typé K Nour
Chambéry, 1993
31 1993 Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ -Calculus R David, K Nour
International Conference on Typed Lambda Calculi and Applications, 162-178, 2005
29 2005 A short proof of the strong normalization of the simply typed R David, K Nour
arXiv preprint arXiv:0905.1557, 2009
28 2009 A semantical proof of the strong normalization theorem for full propositional classical natural deduction K Nour, K Saber
Archive for Mathematical Logic 45 (3), 357-364, 2006
23 2006 Why the usual candidates of reducibility do not work for the symmetric λμ-calculus R David, K Nour
Electronic Notes in Theoretical Computer Science 140, 101-111, 2005
20 2005 La valeur d'un entier classique en-calcul K Nour
Archive for Mathematical Logic 36 (6), 461-473, 1997
20 1997 Storage operators and directed lambda-calculus R David, K Nour
The Journal of Symbolic Logic 60 (4), 1054-1086, 1995
20 1995 A completeness result for a realisability semantics for an intersection type system F Kamareddine, K Nour
Annals of Pure and Applied Logic 146 (2-3), 180-198, 2007
18 2007 Opérateurs de mise en mémoire et types-positifs K Nour
RAIRO-Theoretical Informatics and Applications 30 (3), 261-293, 1996
18 1996 Mixed logic and storage operators K Nour
Archive for Mathematical Logic 39 (4), 261-280, 2000
15 2000 Arithmetical proofs of strong normalization results for symmetric lambda calculi R David, K Nour
arXiv preprint arXiv:0905.0762, 2009
14 2009 Résultats de complétude pour des classes de types du système S Farkh, K Nour
RAIRO-Theoretical Informatics and Applications 31 (6), 513-537, 1997
12 1997 Preuve syntaxique d'un théorème de JL Krivine sur les opérateurs de mise en mémoire K Nour
Comptes rendus de l'Académie des sciences. Série 1, Mathématique 318 (3 …, 1994
11 1994 Un résultat de complétude pour les types∀+ du systeme F S Farkh, K Nour
Comptes Rendus de l'Académie des Sciences-Series I-Mathematics 326 (3), 275-279, 1998
10 1998 Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic K Nour, C Raffalli
Theoretical computer science 308 (1-3), 227-237, 2003
8 2003 A syntactical proof of the operational equivalence of two R David, K Nour
arXiv preprint arXiv:0905.0769, 2009
7 2009 Storage Operators and∀‐positive Types in TTR Type System K Nour
Mathematical Logic Quarterly 42 (1), 349-368, 1996
7 1996 A general type for storage operators K Nour
Mathematical Logic Quarterly 41 (4), 505-514, 1995
7 1995 
Fairouz KamareddineHeriot-Watt UniversityE-mail confirmado em hw.ac.uk
