output
20022009
most citedInferring population history with DIYABC: a user-friendly approach to Approximate Bayesian Computation

688 citations

Showing math.LOShow all

24 papers · 1 filter

math.LO2009

Strong normalization results by translation

René David, Karim Nour

We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed…

math.LO20093 cited

Realisability Semantics for Intersection Types and Expansion Variables

Fairouz Kamareddine, Karim Nour, Vincent Rahli +1

Expansion was invented at the end of the 1970s for calculating principal typings for -terms in type systems with intersection types. Expansion variables (E-variables) were inven…

math.LO20092 cited

Parametric mixed sequent calculus

Karim Nour, Olivier Laurent

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a…

math.LO20096 cited

A short proof of the strong normalization of the simply typed -calculus

René David, Karim Nour

We give an elementary and purely arithmetical proof of the strong normalization of Parigot's simply typed -calculus.

math.LO2009

A semantics of realisability for the classical propositional natural deduction

Karim Nour, Khelifa Saber

In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the opera…

math.LO2009

Why the usual candidates of reducibility do not work for the symmetric -calculus

René David, Karim Nour

The symmetric -calculus is the -calculus introduced by Parigot in which the reduction rule , which is the symmetric of , is added. We give examples explaining why t…