 | 2009 |
|---|
| 27 |       | René David,
Karim Nour:
Strong normalization results by translation
CoRR abs/0905.2892: (2009) |
| 2008 |
|---|
| 26 | | Fairouz Kamareddine,
Karim Nour,
Vincent Rahli,
J. B. Wells:
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables.
ICTAC 2008: 171-185 |
| 2007 |
|---|
| 25 | | René David,
Karim Nour:
An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types.
TLCA 2007: 84-101 |
| 24 | | Fairouz Kamareddine,
Karim Nour:
A completeness result for a realisability semantics for an intersection type system.
Ann. Pure Appl. Logic 146(2-3): 180-198 (2007) |
| 23 | | René David,
Karim Nour:
Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi.
Fundam. Inform. 77(4): 489-510 (2007) |
| 2006 |
|---|
| 22 | | Karim Nour,
Khelifa Saber:
A semantical proof of the strong normalization theorem for full propositional classical natural deduction.
Arch. Math. Log. 45(3): 357-364 (2006) |
| 2005 |
|---|
| 21 | | René David,
Karim Nour:
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus.
TLCA 2005: 162-178 |
| 20 | | René David,
Karim Nour:
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus.
Electr. Notes Theor. Comput. Sci. 140: 101-111 (2005) |
| 19 | | Karim Nour,
Khelifa Saber:
A Semantics of Realisability for the Classical Propositional Natural Deduction.
Electr. Notes Theor. Comput. Sci. 140: 31-39 (2005) |
| 2003 |
|---|
| 18 |  | Samir Farkh,
Karim Nour:
Complete types in an extension of the system AF2.
Journal of Applied Non-Classical Logics 13(1): 73-86 (2003) |
| 17 | | Karim Nour,
Abir Nour:
Propositional mixed logic: its syntax and semantics.
Journal of Applied Non-Classical Logics 13(3-4): 377-390 (2003) |
| 16 | | Karim Nour,
Christophe Raffalli:
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic.
Theor. Comput. Sci. 308(1-3): 227-237 (2003) |
| 2002 |
|---|
| 15 | | Karim Nour:
Non Deterministic Classical Logic: The lambda-mu++-calculus.
Math. Log. Q. 48(3): 357-366 (2002) |
| 2001 |
|---|
| 14 | | Samir Farkh,
Karim Nour:
Les types de données syntaxiques du système F.
ITA 35(3): 207-221 (2001) |
| 13 | | Karim Nour:
Les I-types du système F.
ITA 35(3): 223-237 (2001) |
| 2000 |
|---|
| 12 | | Karim Nour:
Mixed logic and storage operators.
Arch. Math. Log. 39(4): 261-280 (2000) |
| 1998 |
|---|
| 11 | | Karim Nour:
S-Storage Operators.
Math. Log. Q. 44: 99-108 (1998) |
| 1997 |
|---|
| 10 | | Karim Nour:
La valeur d'un entier classique en lm\lambda\mu-calcul.
Arch. Math. Log. 36(6): 461-473 (1997) |
| 9 | | Samir Farkh,
Karim Nour:
Résultats de complétude pour des classes de types du système AF2.
ITA 31(6): 513-537 (1997) |
| 8 | | Karim Nour:
Une réponse négative à la conjecture de E. Tronci pour les systémes numériques typés.
ITA 31(6): 539-558 (1997) |
| 7 | | Karim Nour:
A Conjecture on Numeral Systems.
Notre Dame Journal of Formal Logic 38(2): 270-275 (1997) |
| 6 | | René David,
Karim Nour:
A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms.
Theor. Comput. Sci. 180(1-2): 371-375 (1997) |
| 1996 |
|---|
| 5 | | Karim Nour:
Opérateurs de mise en mémoire et types forall-positifs.
ITA 30(3): 261-293 (1996) |
| 4 | | Karim Nour:
Storage Operators and forall-positive Types in TTR Type System.
Math. Log. Q. 42: 349-368 (1996) |
| 1995 |
|---|
| 3 | | Karim Nour:
Entiers intuitionnistes et entiers classiques en lambda C-calcul.
ITA 29(4): 293-313 (1995) |
| 2 | | René David,
Karim Nour:
Storage Operators and Directed Lambda-Calculus.
J. Symb. Log. 60(4): 1054-1086 (1995) |
| 1 | | Karim Nour:
A General Type for Storage Operators.
Math. Log. Q. 41: 505-514 (1995) |
