Communication dans un congrès

2019

ref_biblio

Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui. Ekstrakto A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, Aug 2019, Natal, Brazil. pp.27-35, ⟨10.4204/EPTCS.301.5⟩. ⟨hal-02200548⟩

Accès au texte intégral et bibtex

2018

ref_biblio

Guillaume Burel. Linking Focusing and Resolution with Selection. 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. pp.9:1-9:14, ⟨10.4230/LIPIcs.MFCS.2018.9⟩. ⟨hal-01670476v3⟩

Accès au texte intégral et bibtex

2014

ref_biblio

Guillaume Burel. Cut Admissibility by Saturation. Joint International Conference, RTA-TLCA 2014, Jul 2014, Vienna, Austria. pp.124-138, ⟨10.1007/978-3-319-08918-8_9⟩. ⟨hal-01097428⟩

Accès au texte intégral et bibtex

2013

ref_biblio

Guillaume Burel. A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo. Third International Workshop on Proof Exchange for Theorem Proving, Jun 2013, Lake Placid, United States. ⟨hal-01126321⟩

Accès au bibtex

2012

ref_biblio

Mathieu Boespflug, Guillaume Burel. CoqInE : Translating the calculus of inductive constructions into the ??-calculus modulo.. Second International Workshop on Proof Exchange for Theorem Proving (PXTP 2012), Jun 2012, Manchester, United Kingdom. ⟨hal-01126128⟩

Accès au bibtex

2011

ref_biblio

Guillaume Burel. Experimenting with deduction modulo. 23rd International Conference on Automated Deduction, Jul 2011, Wroclaw, Poland. pp.162--176. ⟨hal-01125858⟩

Accès au bibtex