Karim Nour

According to our database, Karim Nour authored at least 37 papers between 1995 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Normalization in the simply typed λμμ'ρθε-calculus.

Péter Battyányi, Karim Nour

Math. Struct. Comput. Sci., September, 2022

2018

An estimation for the lengths of reduction sequences of the λμρθ-calculus.

Péter Battyányi, Karim Nour

Log. Methods Comput. Sci., 2018

2017

A revised completeness result for the simply typed λμ-calculus using realizability semantics.

Karim Nour, Mohamad Ziadeh

Log. Methods Comput. Sci., 2017

Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi.

Péter Battyányi, Karim Nour

Log. Methods Comput. Sci., 2017

2014

About the range property for H.

René David, Karim Nour

Log. Methods Comput. Sci., 2014

2012

Some properties of the -calculus.

Karim Nour, Khelifa Saber

J. Appl. Non Class. Logics, 2012

On Realisability Semantics for Intersection Types with Expansion Variables.

Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells

Fundam. Informaticae, 2012

2010

Strong normalization results by translation.

René David, Karim Nour

Ann. Pure Appl. Log., 2010

2009

A completeness result for the simply typed lambdaµ-calculus.

Karim Nour, Khelifa Saber

Ann. Pure Appl. Log., 2009

2008

A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables.

Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells

Proceedings of the Theoretical Aspects of Computing, 2008

2007

Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi.

René David, Karim Nour

Fundam. Informaticae, 2007

A completeness result for a realisability semantics for an intersection type system.

Fairouz Kamareddine, Karim Nour

Ann. Pure Appl. Log., 2007

An Arithmetical Proof of the Strong Normalization for the <i>lambda</i> -Calculus with Recursive Equations on Types.

René David, Karim Nour

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006

A semantical proof of the strong normalization theorem for full propositional classical natural deduction.

Karim Nour, Khelifa Saber

Arch. Math. Log., 2006

2005

Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus.

René David, Karim Nour

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004

A Semantics of Realisability for the Classical Propositional Natural Deduction.

Karim Nour, Khelifa Saber

Proceedings of the Second Workshop on Computational Logic and Applications, 2004

Why the Usual Candidates of Reducibility Do Not Work for the Symmetric <i>lamba-my</i>-calculus.

René David, Karim Nour

Proceedings of the Second Workshop on Computational Logic and Applications, 2004

2003

Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic.

Karim Nour, Christophe Raffalli

Theor. Comput. Sci., 2003

A short proof of the strong normalization of classical natural deduction with disjunction.

René David, Karim Nour

J. Symb. Log., 2003

Propositional mixed logic: its syntax and semantics.

Karim Nour, Abir Nour

J. Appl. Non Class. Logics, 2003

Complete types in an extension of the system AF2.

Samir Farkh, Karim Nour

J. Appl. Non Class. Logics, 2003

2002

Non Deterministic Classical Logic: The lambda-mu⁺⁺-calculus.

Karim Nour

Math. Log. Q., 2002

2001

Les <i>I</i>-types du système <i>F</i>.

Karim Nour

RAIRO Theor. Informatics Appl., 2001

Les types de données syntaxiques du système <i>F</i>.

Samir Farkh, Karim Nour

RAIRO Theor. Informatics Appl., 2001

2000

Mixed logic and storage operators.

Karim Nour

Arch. Math. Log., 2000

1998

S-Storage Operators.

Karim Nour

Math. Log. Q., 1998

1997

A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms.

René David, Karim Nour

Theor. Comput. Sci., 1997

A Conjecture on Numeral Systems.

Karim Nour

Notre Dame J. Formal Log., 1997

Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés.

Karim Nour

RAIRO Theor. Informatics Appl., 1997

Résultats de complétude pour des classes de types du système <i>AF</i>2.

Samir Farkh, Karim Nour

RAIRO Theor. Informatics Appl., 1997

La valeur d'un entier classique en lm\lambda\mu-calcul.

Karim Nour

Arch. Math. Log., 1997

1996

Storage Operators and ∀-positive Types in TTR Type System.

Karim Nour

Math. Log. Q., 1996

Opérateurs de mise en mémoire et types forall-positifs.

Karim Nour

RAIRO Theor. Informatics Appl., 1996

1995

A General Type for Storage Operators.

Karim Nour

Math. Log. Q., 1995

Storage Operators and Directed Lambda-Calculus.

René David, Karim Nour

J. Symb. Log., 1995

Entiers intuitionnistes et entiers classiques en lambda <i>C</i>-calcul.

Karim Nour

RAIRO Theor. Informatics Appl., 1995

Strong storage operators and data types.

Karim Nour

Arch. Math. Log., 1995