Nour, Karim - Laboratoire de Mathématiques, Université de Savoie

• Strong normalization results by translation Rene DAVID and Karim NOUR
• LES TYPES DE DONNEES SYNTAXIQUES DU SYST`EME F
• Universite de Savoie U.F.R. Sciences Fondamentales et Appliquees
• La Valeur d'un Entier Classique en -Calcul Karim Nour 1
• On Storage Operators LAMA -Equipe de Logique
• An arithmetical proof of the strong normalization for the -calculus
• An example of a non adequate numeral system Abstract A numeral system is defined by three closed -terms : a normal -term d0 for Zero,
• STORAGE OPERATORS and -POSITIVE TYPES in TTR TYPE Karim NOUR 1
• Some properties of the Karim NOUR & Khelifa SABER
• Fundamenta Informaticae XXI (2001) 10011031 1001 On Realisability Semantics for Intersection Types with Expansion
• A completeness result for the simply typed Karim NOUR & Khelifa SABER
• A semantics of realisability for the classical propositional natural deduction
• A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion
• PROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS
• S-STORAGE OPERATORS Karim NOUR 1
• A CONJECTURE ON NUMERAL SYSTEMS LAMA -Equipe de Logique
• Types complets dans une extension du syst`eme AF2
• Mixed Logic and Storage Operators LAMA -Equipe de Logique, Universite de Chambery
• A short proof of the strong normalization of the simply typed -calculus
• Storage Operators and Directed Lambda-Calculus Author(s): Rene David and Karim Nour
• A General Type for Storage Operators LAMA -Equipe de Logique, Universite de Chambery
• Une reponse negative `a la conjecture de E.Tronci pour les systemes numeriques types
• Un Resultat de Completude pour les Types + du Syst`eme
• Resultats de completude pour des classes de types du syst`eme AF2 Samir FARKH et Karim NOUR
• Simple proof of the completeness theorem second order classical and intuitionistic logic
• Arithmetical proofs of strong normalization results for the symmetric -calculus
• Computational Logic and Applications, CLA '05 DMTCS proc. AF, 2006, 8796 Classical Combinatory Logic
• Computational Logic and Applications, CLA '05 DMTCS proc. AF, 2006, 97108 Confluency property of the call-by-value
• PARAMETRIC MIXED SEQUENT CALCULUS Olivier LAURENT Karim NOUR
• CURRICULUM VITAE PERSONAL SITUATION
• A semantical proof of the strong normalization theorem for full propositional classical natural
• A short proof of the Strong Normalization of Classical Natural Deduction with Disjunction
• Fundamenta Informaticae XXI (2001) 10011022 1001 Arithmetical proofs of strong normalization results for
• LES I-TYPES DU SYST`EME F I-TYPES OF SYSTEM F
• TABLE DES MATI#RES 1 Table des mati#res
• Some properties of the Karim NOUR & Khelifa SABER
• Fundamenta Informaticae XXI (2001) 10011097 1001 On Realisability Semantics for Intersection Types with Expansion