 |
 |
 |
 |
|
|
|
|---|---|---|
|
hal-00383826v1
Communication dans un congrès
Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells. Realisability Semantics for Intersection Types and Expansion Variables 4th Workshop on Intersection Types and Related Systems (ITRS '08), Mar 2008, Turin, Italy |
||
|
tel-00415534v1
HDR
Karim Nour. Programmation en lambda-calcul pur et typé Mathématiques [math]. Université de Savoie, 2000 |
||
|
hal-00938327v1
Article dans une revue
Karim Nour, Khelifa Saber. Some properties of the lambda-mu-and-or-calculus Journal of Applied Non-Classical Logics, Editions Hermes, 2012, 22 (3), pp.231-247 |
||
|
hal-00937952v1
Article dans une revue
Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells. Challenges and solutions to realisability semantics for intersection types with expansion variables Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2012, 121, pp.153-184 |
||
|
hal-00381602v1
Article dans une revue
René David, Karim Nour. Arithmetical proofs of strong normalization results for symmetric lambda calculi Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2007, 77 (4), pp.489-510 |
||
|
hal-00385206v1
Pré-publication, Document de travail
René David, Karim Nour. Strong normalization results by translation Submitted to APAL. 2009 |
||
|
hal-01421194v3
Pré-publication, Document de travail
Karim Nour, Mohamad Ziadeh. A revised completeness result for the simply typed λµ-calculus using realizability semantics 2016 |
||
|
hal-00382299v1
Communication dans un congrès
René David, Karim Nour. Arithmetical proofs of strong normalization results for the symmetric $\lambda \mu$-calculus Typed Lambda Calculi and Applications, Apr 2005, Nara, Japan. LNCS 3461, pp.162-178, 2005 |
||
|
hal-00382691v1
Communication dans un congrès
Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells. A complete realisability semantics for intersection types and arbitrary expansion variables 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008, 1-3 September 2008, Sep 2008, Istanbul, Turkey. 5160, pp.171-185, 2008 |
||
|
hal-00382306v1
Communication dans un congrès
Karim Nour. On Storage Operators 25 Years of Constructive Type Theory, Oct 1995, Venice, Italy. pp.173-190, 1998 |
||
|
hal-00382357v1
Communication dans un congrès
Karim Nour. Classical Combinatory Logic Computational Logic and Applications, CLA '05, Jun 2005, Chambéry, France. pp.87-96, 2006 |
||
|
hal-00382263v1
Communication dans un congrès
René David, Karim Nour. An arithmetical proof of the strong normalization for the $\lambda$-calculus with recursive equations on types Typed Lambda Calculi and Applications, Jun 2007, Paris, France. LNCS 4583, pp.84-101, 2007 |
||
|
hal-00382688v1
Communication dans un congrès
René David, Karim Nour. A short proof of the strong normalization of the simply typed $\lambda\mu$-calculus Chambéry-Krakow-Lyon: workshop on $\lambda$-calculus, type theory and mathematical logic, Computer science department, Cracovic, Pologne, 27-28 Juin 2003, Jun 2003, Cracovic, Poland. 12, pp.27-33, 2003 |
||
|
hal-00382686v1
Communication dans un congrès
René David, Karim Nour. Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus Second Workshop on Computational Logic and Applications (CLA 2004), Jun 2004, France. 140, pp.101-111, 2005 |
||
|
hal-00382687v1
Communication dans un congrès
Karim Nour, Khelifa Saber. A semantics of realisability for the classical propositional natural deduction Second Workshop on Computational Logic and Applications (CLA 2004), Jun 2004, Lyon, France. 140, pp.31-39, 2005 |
||
|
hal-00382689v1
Autre publication
Karim Nour, Olivier Laurent. Parametric mixed sequent calculus Preprint. 2005 |
||
|
hal-00382364v1
Communication dans un congrès
Karim Nour, Khelifa Saber. Confluency property of the call-by-value $\lambda\mu^{\wedge \vee}$-calculus Computational Logic and Applications, CLA '05, Jun 2005, France. pp.97-108, 2006 |
||
|
hal-00381601v1
Article dans une revue
René David, Karim Nour. A short proof of the Strong Normalization of Classical Natural Deduction with Disjunctio The Journal of Symbolic Logic, 2003, 68 (4), pp.1277-1288 |
||
|
hal-00381607v1
Article dans une revue
Karim Nour. S-storage operators MLQ / MLQ - Math Log Quart; MLQ Mathematical Logic Quarterly; Math Log Quart, 1998, 44, pp.99-108 |
||
|
hal-01421201v1
Pré-publication, Document de travail
Péter Battyányi, Karim Nour. Strong normalization of lambda-Sym-Prop and lambda bare-mu-mu tilde*-calculi 2016 |
||
|
hal-00381215v1
Article dans une revue
Karim Nour, Samir Farkh. Un Résultat de Complétude pour les Types $\forall^+$ du Système F Comptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1998, 326, pp.275-279 |
||
|
hal-00381155v1
Article dans une revue
Samir Farkh, Karim Nour. Résultats de complétude pour des classes de types du système AF2 Informatique Théorique et Applications, 1998, 31 (6), pp.513-537 |
||
|
hal-00381045v1
Article dans une revue
Karim Nour. An example of a non adequate numeral system Comptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1996, 323, pp.439-442 |
||
|
hal-00381049v1
Article dans une revue
Karim Nour. Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés Informatique Théorique et Applications, 1998, 31 (6), pp.539-558 |
||
|
hal-00380721v1
Article dans une revue
Samir Farkh, Karim Nour. Complete Types in an Extension of the System AF2 Journal of Applied Non-Classical Logics, Editions Hermes, 2003, 13, pp.73-85 |
||
|
hal-00380940v1
Article dans une revue
Karim Nour. I-TYPES OF SYSTEM F Informatique Théorique et Applications, 2001, 35, pp.223-237 |
||
|
hal-00380714v1
Article dans une revue
Karim Nour, Abir Nour. Propositional Mixed Logic: Its Syntax and Semantics Journal of Applied Non-Classical Logics, Editions Hermes, 2003, 13, pp.377-390 |
||
|
hal-00381597v1
Article dans une revue
Karim Nour, Christophe Raffalli. Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic Journal of Theoretical Computer Science (TCS), Elsevier, 2003, 308, pp.227-237 |
||
|
hal-00381603v1
Article dans une revue
René David, Karim Nour. A syntactical proof of the operational equivalence of two $\lambda$-terms Journal of Theoretical Computer Science (TCS), Elsevier, 1997, 180, pp.371-375 |
||
|
hal-00381595v1
Article dans une revue
Samir Farkh, Karim Nour. Les types de données syntaxiques du système F Informatique Théorique et Applications, 2001, 35, pp.207-221 |
||
|
|
|