EN FR
EN FR




Bibliography

Major publications by the team in recent years
  • 1G. Dowek.

    Les Métamorphoses du Calcul, Le Pommier, 2007.
  • 2G. Dowek, O. Hermant.

    A Simple Proof That Super-Consistency Implies Cut Elimination, in: Term Rewriting and Applications, 18th International Conference, RTA, F. Baader (editor), Lecture Notes in Computer Science, Springer, 2007, vol. 4533, p. 93-106.
  • 3G. Dowek, B. Werner.

    Proof normalization modulo, in: J. Symb. Log., 2003, vol. 68, no 4, p. 1289-1316.
  • 4G. Gonthier, A. Mahboubi, L. Rideau, E. Tassi, L. Théry.

    A Modular Formalisation of Finite Group Theory, in: Theorem Proving in Higher Order Logics, 20th International Conference, K. Schneider, J. Brandt (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4732, p. 86-101.
  • 5B. Grégoire, L. Théry, B. Werner.

    A Computational Approach to Pocklington Certificates in Type Theory, in: Functional and Logic Programming, 8th International Symposium, M. Hagiya, P. Wadler (editors), Lecture Notes in Computer Science, Springer, 2006, vol. 3945, p. 97-113.
  • 6H. Herbelin, S. Ghilezan.

    An approach to call-by-name delimited continuations, in: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, G. C. Necula, P. Wadler (editors), ACM, 2008, p. 383-394.
  • 7H. Herbelin.

    C'est maintenant qu'on calcule, au cœur de la dualité, Université Paris-Sud, 2005, Habilitation à diriger des recherches.
  • 8A. Miquel.

    Le Calcul des Constructions Implicites : syntaxe et sémantique, Université Paris VII, 2001.
  • 9J. Narboux.

    Mechanical Theorem Proving in Tarski's Geometry, in: Automated Deduction in Geometry, 6th International Workshop, ADG, F. Botana, T. Recio (editors), Lecture Notes in Computer Science, Springer, 2006, vol. 4869, p. 139-156.
  • 10R. Zumkeller.

    Formal Global Optimisation with Taylor Models, in: Automated Reasoning, Third International Joint Conference, IJCAR, U. Furbach, N. Shankar (editors), Lecture Notes in Computer Science, Springer, 2006, vol. 4130, p. 408-422.
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11M. Boespflug.

    Conception d'un noyau de vérification de preuves pour le λΠ-calcul modulo, Ecole Polytechnique, January 2011.
  • 12A. Spiwack.

    Calculs vérifiés en algèbre homologique, Ecole Polytechnique, March 2011.

    http://hal.inria.fr/pastel-00605836/en

Articles in International Peer-Reviewed Journal

  • 13P. Arrighi, G. Dowek.

    The physical Church-Turing thesis and the principles of quantum theory, in: International Journal of Foundations of Computer Science, 2011, to appear.
  • 14Y. Bertot, F. Guilhot, A. Mahboubi.

    A formal study of Bernstein coefficients and polynomials, in: Mathematical Structures in Computer Science, 2011, vol. 21, no 04, p. 731-761.

    http://hal.inria.fr/inria-00503017/en
  • 15G. Dowek, M. J. Gabbay.

    Permissive Nominal Logic (journal version), in: Transactions on Computational Logic, 2011, to appear.

    http://www.gabbay.org.uk/papers/pernl-jv.pdf
  • 16G. Dowek, O. Hermant.

    A simple proof that super-consistency implies cut elimination, in: Notre Dame Journal of Formal Logic, 2011, to appear.
  • 17G. Dowek, Y. Jiang.

    On the expressive power of schemes, in: Inf. Comput., 2011, vol. 209, no 9, p. 1231-1245.
  • 18G. Lee, B. Werner.

    Proof-irrelevant model of CC with predicative induction and judgmental equality, in: Logical Methods in Computer Science, 2011, to appear.
  • 19C. Rocha, C. Muñoz, G. Dowek.

    A formal library of set relations and its application to synchronous languages, in: Theor. Comput. Sci., 2011, vol. 412, no 37, p. 4853-4866.

International Conferences with Proceedings

  • 20M. Armand, G. Faure, B. Grégoire, C. Keller, L. Théry, B. Werner.

    Verifying SAT and SMT in Coq for a fully automated decision procedure, in: PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories, Wroclaw, Poland, Germain Faure, Stéphane Lengrand, Assia Mahboubi, 2011.

    http://hal.inria.fr/inria-00614041/en
  • 21B. Barras, J.-P. Jouannaud, P.-Y. Strub, Q. Wang.

    CoqMTU: a higher-order type theory with a predicative hierarchy of universes parametrized by a decidable first-order theory, in: Twenty-Sixth Annual IEEE Symposium on "Logic in Computer Science", Toronto, Canada, 2011.

    http://hal.inria.fr/inria-00583136/en
  • 22A. Bernadet, Stéphane. Lengrand.

    Complexity of strongly normalising λ-terms via non-idempotent intersection types, in: Proceedings of the 14th international conference on Foundations of Software Science and Computation Structures (FOSSACS'11), M. Hofmann (editor), LNCS, Springer-Verlag, March 2011, vol. 6604, p. 88–107.
  • 23A. Bernadet, Stéphane. Lengrand.

    Filter models: non-idempotent intersection types, orthogonality and polymorphism, in: Proceedings of the 20th Annual conference of the European Association for Computer Science Logic (CSL'11), M. Bezem (editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, September 2011.
  • 24J. Gao.

    Clausal Presentation of Theories in Deduction Modulo, in: PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories, Wroclaw, Poland, Germain Faure, Stéphane Lengrand, Assia Mahboubi, 2011.

    http://hal.inria.fr/inria-00614251/en
  • 25C. Keller, M. Armand, G. Faure, B. Grégoire, L. Théry, B. Werner.

    A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, in: Certified Programs and Proofs 2011, Howard Beach Resort Kenting, Taiwan, Province Of China, J.-P. Jouannaud, Z. Shao (editors), Springer, December 2011.

    http://hal.inria.fr/hal-00639130/en

Books or Proceedings Editing

  • 26G. Dowek (editor)

    Introduction à la science informatique, CRDP de Paris, 2011.

Other Publications