Homepage Inria website
  • Inria login
  • The Inria's Research Teams produce an annual Activity Report presenting their activities and their results of the year. These reports include the team members, the scientific program, the software developed by the team and the new results of the year. The report also describes the grants, contracts and the activities of dissemination and teaching. Finally, the report gives the list of publications of the year.

  • Legal notice
  • Cookie management
  • Personal data
  • Cookies


Major publications by the team in recent years
  • 1A. 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.
  • 2B. Barras, T. Coquand, S. Huber.

    A generalization of the Takeuti-Gandy interpretation, in: Mathematical Structures in Computer Science, 2015, vol. 25, no 5, pp. 1071–1099.
  • 3F. 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 ]
  • 4F. 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 ]
  • 5G. 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.
  • 6D. Cousineau, G. Dowek.

    Embedding Pure Type Systems in the λΠ-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.
  • 7G. Dowek, T. Hardin, C. Kirchner.

    Theorem proving modulo, in: Journal of Automated Reasoning, 2003, vol. 31, pp. 33-73.
  • 8O. Hermant.

    Resolution is Cut-Free, in: Journal of Automated Reasoning, March 2010, vol. 44, no 3, pp. 245-276.
  • 9M. 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.
  • 10M. 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

Doctoral Dissertations and Habilitation Theses

  • 11F. Gilbert.

    Extending higher-order logic with predicate subtyping: Application to PVS, Université Sorbonne Paris Cité ; Université Paris Diderot, April 2018.

Articles in International Peer-Reviewed Journals

International Conferences with Proceedings

  • 16F. Blanqui, G. Genestier.

    Termination of λΠ modulo rewriting using the size-change principle (work in progress), in: 16th International Workshop on Termination, Oxford, United Kingdom, S. Lucas (editor), July 2018, pp. 10-14,
  • 17G. Burel.

    Linking Focusing and Resolution with Selection, in: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, United Kingdom, I. Potapov, P. Spirakis, J. Worrell (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, August 2018, vol. 117, pp. 9:1-9:14. [ DOI : 10.4230/LIPIcs.MFCS.2018.9 ]
  • 18N. Dershowitz, J.-P. Jouannaud.

    Drags: A Simple Algebraic Framework For Graph Rewriting, in: TERMGRAPH 2018 - 10th International Workshop on Computing with Terms and Graphs, Oxford, United Kingdom, July 2018.

National Conferences with Proceedings

Conferences without Proceedings

  • 20N. Dershowitz, J.-P. Jouannaud.

    Graph Path Orderings, in: 2nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, G. Barthe, G. Sutcliffe, M. Veanes (editors), EPiC Series in Computing, November 2018, vol. 57, pp. 1-18.

Internal Reports

Other Publications

References in notes
  • 28A. Assaf.

    A framework for defining computational higher-order logics, École polytechnique, September 2015.
  • 29M. Boespflug.

    Conception d'un noyau de vérification de preuves pour le λΠ-calcul modulo, École Polytechnique, 2011.
  • 30G. Bury, S. Cruanes, D. Delahaye, P. Euvrard.

    An Automation-Friendly Set Theory for the B Method, in: Abstract State Machines, Alloy, B, TLA, VDM, and Z - 6th International Conference, ABZ 2018, Southampton, UK, June 5-8, 2018, Proceedings, M. J. Butler, A. Raschke, T. S. Hoang, K. Reichl (editors), Lecture Notes in Computer Science, Springer, 2018, vol. 10817, pp. 409–414.
  • 31G. 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.
  • 32R. Lepigre.

    PML 2 : Integrated Program Verification in ML, in: 23rd International Conference on Types for Proofs and Programs (TYPES 2017), Budapest, Hungary, July 2017, 27 p. [ DOI : 10.4230/LIPIcs.TYPES.2017.5 ]