| Defining and reasoning about recursive functions: a practical tool for the Coq proof assistant G Barthe, J Forest, D Pichardie, V Rusu International Symposium on Functional and Logic Programming, 114-129, 2006 | 79 | 2006 |
| Certification of automated termination proofs E Contejean, P Courtieu, J Forest, O Pons, X Urbain International Symposium on Frontiers of Combining Systems, 148-162, 2007 | 74 | 2007 |
| Automated certified proofs with CiME3 E Contejean, P Courtieu, J Forest, O Pons, X Urbain 22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011 | 55 | 2011 |
| A3PAT, an approach for certified automated termination proofs É Contejean, P Courtieu, J Forest, A Paskevich, O Pons, X Urbain 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 63-72, 2010 | 48 | 2010 |
| CiME3, 2007 É Contejean, P Courtieu, J Forest, O Pons, X Urbain URL http://cime. lri. fr. http://cime. lri. fr, 0 | 26* | |
| Structural analysis of narratives with the Coq proof assistant AG Bosser, P Courtieu, J Forest, M Cavazza International Conference on Interactive Theorem Proving, 55-70, 2011 | 20 | 2011 |
| A weak calculus with explicit operators for pattern matching and substitution J Forest International Conference on Rewriting Techniques and Applications, 174-191, 2002 | 20 | 2002 |
| Certifying a termination criterion based on graphs, without graphs P Courtieu, J Forest, X Urbain International Conference on Theorem Proving in Higher Order Logics, 183-198, 2008 | 15 | 2008 |
| Expression reduction systems with patterns J Forest, D Kesner International Conference on Rewriting Techniques and Applications, 107-122, 2003 | 13 | 2003 |
| Deep-embedded unification E Contejean, J Forest, X Urbain Technical Report 1547, Cédric, 2008 | 3 | 2008 |
| Réécriture d'ordre supérieur avec motifs J FOREST UNIVERSITÉ PARIS, 2003 | 1 | 2003 |
| Une preuve est une histoire AG Bosser, MV Aponte, P Courtieu, J Forest Vingt-septièmes Journées Francophones des Langages Applicatifs (JFLA 2016), 2016 | | 2016 |
| Expression Reduction Systems with Patterns J Forest, D Kesner Journal of Automated Reasoning 39 (4), 513-541, 2007 | | 2007 |
| Strong normalization by reducibility of the weak Ap calculus J FOREST Extended Abstracts of the Fifth International Workshop on Termination (WST …, 2001 | | 2001 |
| Une preuve est un programme un plan une histoire AG Bosser, MV Aponte, P Courtieu, J Forest | | |
| A proof of strong normalization by reducibility modulo for λσw J Forest | | |
| D e nition des strat effigies paresseuse et stricte pour TPC et TPCES J Forest | | |
| Proving termination of higher-order functional programs J Forest, S Lucas | | |
| Evaluation Strategies for Calculi with Explicit Pattern Matching and Substitutions J FOREST | | |
Xavier UrbainFull Professor of Computer Science, University Claude Bernard Lyon 1Verified email at liris.cnrs.fr
