The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Karim Nour: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. [Citation Graph (, )][DBLP]


  25. Mixed logic and storage operators. [Citation Graph (, )][DBLP]


  26. La valeur d'un entier classique en lm\lambda\mu-calcul. [Citation Graph (, )][DBLP]


  27. A completeness result for the simply typed lambdaµ-calculus. [Citation Graph (, )][DBLP]


  28. Strong normalization results by translation [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002