| An estimation for the lengths of reduction sequences of the λμρθ-calculus. | 0 | 0.34 | 2018 |
| A revised completeness result for the simply typed λμ-calculus using realizability semantics. | 0 | 0.34 | 2017 |
| Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi. | 0 | 0.34 | 2017 |
| About the range property for H. | 0 | 0.34 | 2014 |
| On Realisability Semantics for Intersection Types with Expansion Variables | 2 | 0.37 | 2012 |
| Some properties of the -calculus. | 0 | 0.34 | 2012 |
| Strong normalization results by translation | 0 | 0.34 | 2010 |
| A completeness result for the simply typed lambdaµ-calculus | 0 | 0.34 | 2009 |
| A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables | 2 | 0.43 | 2008 |
| A completeness result for a realisability semantics for an intersection type system | 6 | 0.46 | 2007 |
| An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types | 1 | 0.36 | 2007 |
| Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi | 1 | 0.35 | 2007 |
| A semantical proof of the strong normalization theorem for full propositional classical natural deduction | 9 | 0.63 | 2006 |
| Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus | 2 | 0.37 | 2005 |
| A Semantics of Realisability for the Classical Propositional Natural Deduction | 1 | 0.35 | 2005 |
| Arithmetical proofs of strong normalization results for symmetric lambda-calculi | 4 | 0.41 | 2005 |
| Propositional mixed logic: its syntax and semantics | 2 | 0.39 | 2003 |
| A short proof of the strong normalization of classical natural deduction with disjunction | 10 | 0.70 | 2003 |
| Complete types in an extension of the system AF2 | 1 | 0.38 | 2003 |
| Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic | 2 | 0.44 | 2003 |
| Non Deterministic Classical Logic: The lambda-mu++-calculus | 1 | 0.35 | 2002 |
| Les types de données syntaxiques du système F | 0 | 0.34 | 2001 |
| Les I-types du système F | 1 | 0.48 | 2001 |
| Mixed logic and storage operators | 4 | 0.63 | 2000 |
| S-Storage Operators | 0 | 0.34 | 1998 |
| Résultats de complétude pour des classes de types du système AF2 | 1 | 0.39 | 1997 |
| Value Of A Classical Integer In Lambda Mu-Calculus | 0 | 0.34 | 1997 |
| A syntactical proof of the operational equivalence of two &lgr;-terms | 2 | 0.50 | 1997 |
| A Conjecture on Numeral Systems | 0 | 0.34 | 1997 |
| Une réponse négative à la conjecture de E. Tronci pour les systémes numériques typés | 0 | 0.34 | 1997 |
| Storage Operators And For All-Positive Types In Ttr Type System | 2 | 0.44 | 1996 |
| Opérateurs de mise en mémoire et types forall-positifs | 0 | 0.34 | 1996 |
| Entiers intuitionnistes et entiers classiques en lambda C-calcul | 0 | 0.34 | 1995 |
| A General Type For Storage Operators | 3 | 0.59 | 1995 |
| Storage Operators And Directed Lambda-Calculus | 5 | 0.67 | 1995 |
| Strong storage operators and data types. | 3 | 0.61 | 1995 |
