| Dependent Types for Extensive Games. | 0 | 0.34 | 2018 |
| Quantitative aspects of linear and affine closed lambda terms. | 0 | 0.34 | 2018 |
| Counting Environments and Closures. | 0 | 0.34 | 2018 |
| A Congruence Relation for Restructuring Classical Terms. | 0 | 0.34 | 2017 |
| Combinatorics of $$\lambda$$-terms: a natural approach. | 0 | 0.34 | 2017 |
| Combinatorics of λ-terms: a natural approach. | 0 | 0.34 | 2016 |
| A Natural Counting of Lambda Terms. | 6 | 0.53 | 2016 |
| Counting and generating terms in the binary lambda calculus | 0 | 0.34 | 2015 |
| The risk of divergence | 0 | 0.34 | 2015 |
| Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). | 0 | 0.34 | 2015 |
| Counting and Generating Terms in the Binary Lambda Calculus (Extended version). | 9 | 0.74 | 2015 |
| Intelligent escalation and the principle of relativity | 1 | 0.40 | 2015 |
| Counting Terms in the Binary Lambda Calculus. | 5 | 0.69 | 2014 |
| Boltzmann samplers for random generation of lambda terms. | 4 | 0.49 | 2014 |
| Resource control and intersection types: an intrinsic connection. | 0 | 0.34 | 2014 |
| An exercise on streams: convergence acceleration. | 1 | 0.37 | 2013 |
| A simple case of rationality of escalation. | 2 | 0.43 | 2013 |
| A journey through resource control lambda calculi and explicit substitution using intersection types (an account). | 0 | 0.34 | 2013 |
| Common knowledge logic in a higher order proof assistant? | 0 | 0.34 | 2013 |
| Counting and generating lambda terms | 5 | 0.60 | 2013 |
| Les krachs sont rationnels. | 0 | 0.34 | 2013 |
| Bubbles are rational | 0 | 0.34 | 2013 |
| “Backward” coinduction, Nash equilibrium and the rationality of escalation | 8 | 0.69 | 2012 |
| Computational interpretation of classical logic with explicit structural rules | 0 | 0.34 | 2012 |
| On counting untyped lambda terms | 3 | 0.40 | 2011 |
| Les crashs sont rationnels | 0 | 0.34 | 2011 |
| Resource control and strong normalisation | 0 | 0.34 | 2011 |
| Rationality and Escalation in Infinite Extensive Games | 5 | 0.65 | 2011 |
| Intersection types for the resource control lambda calculi | 1 | 0.35 | 2011 |
| On the Rationality of Escalation | 0 | 0.34 | 2010 |
| Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games | 2 | 0.44 | 2009 |
| Intuitionistic sequent-style calculus with explicit structural rules | 4 | 0.39 | 2009 |
| Deconstruction of Infinite Extensive Games using coinduction | 4 | 0.50 | 2009 |
| Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage | 11 | 0.55 | 2008 |
| Computation with classical sequents | 7 | 0.51 | 2008 |
| Conversion/Preference Games | 1 | 0.37 | 2008 |
| (Mechanical) Reasoning on Infinite Extensive Games | 0 | 0.34 | 2008 |
| Dynamic Logic of Common Knowledge in a Proof Assistant | 3 | 0.47 | 2007 |
| Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004 | 0 | 0.34 | 2006 |
| Rewriting game theory as a foundation for state-based models of gene regulation | 1 | 0.39 | 2006 |
| Mechanizing common knowledge logic using COQ | 5 | 0.80 | 2006 |
| Addressed term rewriting systems: application to a typed object calculus | 5 | 0.45 | 2006 |
| Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract | 6 | 0.47 | 2005 |
| The Language chi: Circuits, Computations and Classical Logic | 9 | 0.56 | 2005 |
| Strong normalization of the dual classical sequent calculus | 7 | 0.66 | 2005 |
| Intersection and Union Types in the lambda-my-my/tilde-calculus | 0 | 0.34 | 2005 |
| Characterizing strong normalization in a language with control operators | 5 | 0.45 | 2004 |
| Intersection types for explicit substitutions | 16 | 0.71 | 2004 |
| Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract | 0 | 0.34 | 2003 |
| An Improved System of Intersection Types for Explicit Substitutions | 2 | 0.40 | 2002 |
