Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub


Major publications by the team in recent years
A. Assaf, G. Burel, R. Cauderlier, D. Delahaye, G. Dowek, C. Dubois, F. Gilbert, P. Halmagrand, O. Hermant, R. Saillard.
Expressing theories in the λΠ-calculus modulo theory and in the Dedukti system, in: 22nd International Conference on Types for Proofs and Programs, TYPES 2016, Novi SAd, Serbia, May 2016.
F. Blanqui.
Definitions by rewriting in the Calculus of Constructions, in: Mathematical Structures in Computer Science, 2005, vol. 15, no 1, pp. 37-92. [ DOI : 10.1017/S0960129504004426 ]
F. Blanqui, J.-P. Jouannaud, A. Rubio.
The Computability Path Ordering, in: Logical Methods in Computer Science, October 2015. [ DOI : 10.2168/LMCS-11(4:3)2015 ]
G. Burel.
Experimenting with Deduction Modulo, in: CADE 2011, V. Sofronie-Stokkermans, N. Bjørner (editors), Lecture Notes in Artificial Intelligence, Springer, 2011, vol. 6803, pp. 162–176.
D. Cousineau, G. Dowek.
Embedding Pure Type Systems in the lambda-Pi-calculus modulo, in: Typed lambda calculi and applications, S. Ronchi della Rocca (editor), Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 4583, pp. 102-117.
G. Dowek, T. Hardin, C. Kirchner.
Theorem proving modulo, in: Journal of Automated Reasoning, 2003, vol. 31, pp. 33-73.
C. Dubois, T. Hardin, V. Donzeau-Gouge.
Building certified components within FOCAL, in: Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, TFP 2004, München, Germany, 25-26 November 2004, H.-W. Loidl (editor), Trends in Functional Programming, Intellect, 2006, vol. 5, pp. 33-48.
O. Hermant.
Resolution is Cut-Free, in: Journal of Automated Reasoning, March 2010, vol. 44, no 3, pp. 245-276.
M. Jacquel, K. Berkani, D. Delahaye, C. Dubois.
Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving, in: Software and Systems Modeling (SoSyM), June 2013.
M. Jacquel, K. Berkani, D. Delahaye, C. Dubois.
Tableaux Modulo Theories Using Superdeduction, in: Global Journal of Advanced Software Engineering (GJASE), December 2014, vol. 1, pp. 1 - 13. [ DOI : 10.1007/978-3-642-31365-3_26 ]
Publications of the year

Articles in International Peer-Reviewed Journals

G. Dowek.
Rules and derivations in an elementary logic course, in: IfColog Journal of Logics and their Applications (FLAP), January 2017, vol. 4, no 1,

Invited Conferences

G. Dowek.
Analyzing individual proofs as the basis of interoperability between proof systems, in: PxTP 2017 - Fifth Workshop on Proof eXchange for Theorem Proving, Brasilia, Brazil, September 2017.

International Conferences with Proceedings

A. Díaz-Caro, G. Dowek.
Typing Quantum Superpositions and Measurement, in: TPNC 2017 - 6th International Conference on the Theory and Practice of Natural Computing, Prague, Czech Republic, C. Martín-Vide, R. Neruda, M. A. Vega-Rodríguez (editors), Lecture Notes in Computer Science, Springer, December 2017, vol. 10687, 13 p, [ DOI : 10.1007/978-3-319-71069-3_22 ]
F. Gilbert.
Automated Constructivization of Proofs, in: FoSSaCS 2017, Uppsala, Sweden, April 2017. [ DOI : 10.1007/978-3-662-54458-7_28 ]
F. Gilbert.
Proof certificates in PVS, in: ITP 2017, Brasilia, Brazil, September 2017. [ DOI : 10.1007/978-3-319-66107-0_17 ]
J.-P. Jouannaud, P.-Y. Strub.
Coq without Type Casts: A Complete Proof of Coq Modulo Theory, in: LPAR-21: 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 2017.

Scientific Popularization

S. Abiteboul, G. Dowek.
Le temps des algorithmes, Editions Le Pommier, 2017, 192 p.

Other Publications

A. Assaf, G. Dowek, J.-P. Jouannaud, J. Liu.
Untyped Confluence In Dependent Type Theories: Full version, April 2017, working paper or preprint.
F. Blanqui.
Size-based termination of higher-order rewriting, December 2017, working paper or preprint.
G. Burel.
Linking Focusing and Resolution with Selection, December 2017, working paper or preprint.
G. Bury.
mSAT:An OCaml SAT Solver, September 2017, OCaml Users and Developers Workshop, Poster.
A. Defourné.
Proof Tactics in Dedukti, ENSIMAG, September 2017.
G. Dowek.
Models and termination of proof reduction in the λΠ-calculus modulo theory, April 2017, working paper or preprint.
G. Genestier.
Termination checking in the λΠ-calculus modulo theory.From a practical and a theoretical viewpoint, Université Paris Diderot (Paris 7), September 2017.
F. Gilbert.
Extending higher-order logic with predicate subtyping: application to PVS, December 2017, working paper or preprint.
F. Thiré.
Exporting an Arithmetic Library from Dedukti to HOL, December 2017, working paper or preprint.
References in notes
Y. Bertot, P. Castéran.
Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer-Verlag, 2004.
F. Bobot, J.-C. Filliâtre, C. Marché, A. Paskevich.
Why3: Shepherd Your Herd of Provers, in: First International Workshop on Intermediate Verification Languages, 2011.
M. Boespflug.
Conception d'un noyau de vérification de preuves pour le lambda-Pi-calcul modulo, École Polytechnique, 2011.
G. Dowek.
A Theory Independent Curry-de Bruijn-howard Correspondence, in: Proceedings of the 39th International Colloquium Conference on Automata, Languages, and Programming - Volume Part II, Berlin, Heidelberg, ICALP'12, Springer-Verlag, 2012, pp. 13–15.
R. Harper, F. Honsell, G. Plotkin.
A Framework for Defining Logics, in: Journal of the association for computing machinery, 1993, pp. 194–204.
J. Harrison.
HOL Light: An Overview, in: Theorem Proving in Higher Order Logics, S. Berghofer, T. Nipkow, C. Urban, M. Wenzel (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2009, vol. 5674, pp. 60-66.
J. Hughes, L. Pareto, A. Sabry.
Proving the correctness of reactive systems using sized types, in: Proceedings of the 23th ACM Symposium on Principles of Programming Languages, 1996.
C. S. Lee, N. D. Jones, A. M. Ben-Amram.
The size-change principle for program termination, in: Proceedings of the 28th ACM Symposium on Principles of Programming Languages, 2001.
R. Lepigre.
PML2, programming language with support for program proofs, 2017, Submitted for the post-proceedings of TYPES.
R. Lepigre.
Lambdapi, implementation of the λΠ-calculus modulo rewriting, 2017.
R. Lepigre.
Semantics and Implementation of an Extension of ML for program proving, Université Grenoble Alpes, France, 2017.
R. Lepigre, C. Raffalli.
Bindlib, representation of binders in OCaml, 2015.
R. Lepigre, C. Raffalli.
Practical Subtyping for System F with Sized (Co-)Induction, 2017, Submitted to the TOPLAS journal (under revision).
D. Wahlstedt.
Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion, Chalmers University of Technology, 2007, ISBN 978-91-7291-979-2.