Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarim Nour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j32]Péter Battyányi
, Karim Nour:
Normalization in the simply typed λμμ'ρθε-calculus. Math. Struct. Comput. Sci. 32(8): 1066-1098 (2022)
2010 – 2019
- 2018
- [j31]Péter Battyányi, Karim Nour:
An estimation for the lengths of reduction sequences of the λμρθ-calculus. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [j30]Péter Battyányi, Karim Nour:
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi. Log. Methods Comput. Sci. 13(3) (2017) - [j29]Karim Nour, Mohamad Ziadeh:
A revised completeness result for the simply typed λμ-calculus using realizability semantics. Log. Methods Comput. Sci. 13(3) (2017) - 2016
- [i2]Karim Nour, Mohamad Ziadeh:
A revised completeness result for the simply typed $λμ$-calculus using realizability semantics. CoRR abs/1612.09223 (2016) - 2014
- [j28]René David, Karim Nour:
About the range property for H. Log. Methods Comput. Sci. 10(1) (2014) - 2012
- [j27]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Informaticae 121(1-4): 153-184 (2012) - [j26]Karim Nour, Khelifa Saber:
Some properties of the -calculus. J. Appl. Non Class. Logics 22(3): 231-247 (2012) - 2010
- [j25]René David, Karim Nour:
Strong normalization results by translation. Ann. Pure Appl. Log. 161(9): 1171-1179 (2010)
2000 – 2009
- 2009
- [j24]Karim Nour, Khelifa Saber:
A completeness result for the simply typed lambdaµ-calculus. Ann. Pure Appl. Log. 161(1): 109-118 (2009) - [i1]René David, Karim Nour:
Strong normalization results by translation. CoRR abs/0905.2892 (2009) - 2008
- [c5]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
- [j23]Fairouz Kamareddine, Karim Nour:
A completeness result for a realisability semantics for an intersection type system. Ann. Pure Appl. Log. 146(2-3): 180-198 (2007) - [j22]René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi. Fundam. Informaticae 77(4): 489-510 (2007) - [c4]René David, Karim Nour:
An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. TLCA 2007: 84-101 - 2006
- [j21]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
- [c3]René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. TLCA 2005: 162-178 - 2004
- [c2]Karim Nour, Khelifa Saber:
A Semantics of Realisability for the Classical Propositional Natural Deduction. CLA 2004: 31-39 - [c1]René David, Karim Nour:
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus. CLA 2004: 101-111 - 2003
- [j20]Samir Farkh, Karim Nour:
Complete types in an extension of the system AF2. J. Appl. Non Class. Logics 13(1): 73-86 (2003) - [j19]Karim Nour, Abir Nour:
Propositional mixed logic: its syntax and semantics. J. Appl. Non Class. Logics 13(3-4): 377-390 (2003) - [j18]René David, Karim Nour:
A short proof of the strong normalization of classical natural deduction with disjunction. J. Symb. Log. 68(4): 1277-1288 (2003) - [j17]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
- [j16]Karim Nour:
Non Deterministic Classical Logic: The lambda-mu++-calculus. Math. Log. Q. 48(3): 357-366 (2002) - 2001
- [j15]Samir Farkh, Karim Nour:
Les types de données syntaxiques du système F. RAIRO Theor. Informatics Appl. 35(3): 207-221 (2001) - [j14]Karim Nour:
Les I-types du système F. RAIRO Theor. Informatics Appl. 35(3): 223-237 (2001) - 2000
- [j13]Karim Nour:
Mixed logic and storage operators. Arch. Math. Log. 39(4): 261-280 (2000)
1990 – 1999
- 1998
- [j12]Karim Nour:
S-Storage Operators. Math. Log. Q. 44: 99-108 (1998) - 1997
- [j11]Karim Nour:
La valeur d'un entier classique en lm\lambda\mu-calcul. Arch. Math. Log. 36(6): 461-473 (1997) - [j10]Samir Farkh, Karim Nour:
Résultats de complétude pour des classes de types du système AF2. RAIRO Theor. Informatics Appl. 31(6): 513-537 (1997) - [j9]Karim Nour:
Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés. RAIRO Theor. Informatics Appl. 31(6): 539-558 (1997) - [j8]Karim Nour:
A Conjecture on Numeral Systems. Notre Dame J. Formal Log. 38(2): 270-275 (1997) - [j7]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
- [j6]Karim Nour:
Opérateurs de mise en mémoire et types forall-positifs. RAIRO Theor. Informatics Appl. 30(3): 261-293 (1996) - [j5]Karim Nour:
Storage Operators and ∀-positive Types in TTR Type System. Math. Log. Q. 42: 349-368 (1996) - 1995
- [j4]Karim Nour:
Strong storage operators and data types. Arch. Math. Log. 34(1): 65-78 (1995) - [j3]Karim Nour:
Entiers intuitionnistes et entiers classiques en lambda C-calcul. RAIRO Theor. Informatics Appl. 29(4): 293-313 (1995) - [j2]René David, Karim Nour:
Storage Operators and Directed Lambda-Calculus. J. Symb. Log. 60(4): 1054-1086 (1995) - [j1]Karim Nour:
A General Type for Storage Operators. Math. Log. Q. 41: 505-514 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-22 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
