 | 2011 |
|---|
| 10 |       | Guillaume Burel:
Experimenting with Deduction Modulo.
CADE 2011: 162-176 |
| 9 | | Guillaume Burel:
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Logical Methods in Computer Science 7(1): (2011) |
| 2010 |
|---|
| 8 | | Guillaume Burel:
Embedding Deduction Modulo into a Prover.
CSL 2010: 155-169 |
| 7 | | Guillaume Burel,
Claude Kirchner:
Regaining cut admissibility in deduction modulo using abstract completion.
Inf. Comput. 208(2): 140-164 (2010) |
| 2009 |
|---|
| 6 | | Guillaume Burel:
Automating Theories in Intuitionistic Logic.
FroCos 2009: 181-197 |
| 5 | | Guillaume Burel,
Gilles Dowek:
How can we prove that a proof search method is not an instance of another?
LFMTP 2009: 84-87 |
| 2008 |
|---|
| 4 | | Guillaume Burel:
A First-Order Representation of Pure Type Systems Using Superdeduction.
LICS 2008: 253-263 |
| 2007 |
|---|
| 3 | | Guillaume Burel:
Unbounded Proof-Length Speed-Up in Deduction Modulo.
CSL 2007: 496-511 |
| 2 | | Guillaume Burel,
Claude Kirchner:
Cut Elimination in Deduction Modulo by Abstract Completion.
LFCS 2007: 115-131 |
| 2006 |
|---|
| 1 | | Guillaume Burel,
Claude Kirchner:
Completion Is an Instance of Abstract Canonical System Inference.
Essays Dedicated to Joseph A. Goguen 2006: 497-520 |
Data released under the ODC-BY 1.0 license — See also our legal information page