| |
| 2008 | ||
|---|---|---|
| 5 | EE | Guillaume Burel: A First-Order Representation of Pure Type Systems Using Superdeduction. LICS 2008: 253-263 |
| 4 | EE | Guillaume Burel: Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo CoRR abs/0805.1464: (2008) |
| 2007 | ||
| 3 | EE | Guillaume Burel: Unbounded Proof-Length Speed-Up in Deduction Modulo. CSL 2007: 496-511 |
| 2 | EE | Guillaume Burel, Claude Kirchner: Cut Elimination in Deduction Modulo by Abstract Completion. LFCS 2007: 115-131 |
| 2006 | ||
| 1 | EE | Guillaume Burel, Claude Kirchner: Completion Is an Instance of Abstract Canonical System Inference. Essays Dedicated to Joseph A. Goguen 2006: 497-520 |
| 1 | Claude Kirchner | [1] [2] |