Principles of Superdeduction, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.41-50, 2007. ,
DOI : 10.1109/LICS.2007.37
URL : https://hal.archives-ouvertes.fr/inria-00133557
Pattern matching as cut elimination, Theoretical Computer Science, vol.323, issue.1-3, pp.71-127, 2004. ,
DOI : 10.1016/j.tcs.2004.03.032
URL : https://hal.archives-ouvertes.fr/hal-00148839
The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001. ,
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532
The duality of computation, ICFP, pp.233-243, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00156377
The Duality of Computation under Focus, IFIP TCS, 2010. ,
DOI : 10.1007/978-3-642-15240-5_13
URL : https://hal.archives-ouvertes.fr/hal-01054461
Theorem proving modulo, Journal of Automated Reasoning, vol.31, issue.1, pp.33-72, 2003. ,
DOI : 10.1023/A:1027357912519
URL : https://hal.archives-ouvertes.fr/hal-01199506
Axiom Directed Focusing, TYPES, pp.169-185, 2008. ,
DOI : 10.1016/S0168-0072(00)00032-4
URL : https://hal.archives-ouvertes.fr/inria-00212059
Représentation et interaction des preuves en superdéduction modulo, 2010. ,
Focusing and Polarization in Intuitionistic Logic, CSL, pp.451-465, 2007. ,
DOI : 10.1007/978-3-540-74915-8_34
URL : https://hal.archives-ouvertes.fr/inria-00167231
A Unified Sequent Calculus for Focused Proofs, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.355-364, 2009. ,
DOI : 10.1109/LICS.2009.47
Focalisation and Classical Realisability, CSL, pp.409-423, 2009. ,
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00409793
Classical Logic and Computation, 2000. ,
Typage et déduction dans le calcul de réécriture, 2005. ,
Focusing and higher-order abstract syntax, POPL, pp.359-369, 2008. ,