Bibliography

• 1M. Boespflug.
  
  Conception d'un noyau de vérification de preuves pour le lambda-Pi-calcul modulo, École Polytechnique, 2011.
• 2G. Burel.
  
  Experimenting with Deduction Modulo, in: CADE 2011, V. Sofronie-Stokkermans, N. Bjørner (editors), Lecture Notes in Artificial Intelligence, Springer, 2011, vol. 6803, p. 162–176.
• 3D. 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, p. 102-117.
• 4G. Dowek.
  
  Polarized Resolution Modulo, in: IFIP Theoretical Computer Science, 2010.
• 5G. Dowek, T. Hardin, C. Kirchner.
  
  HOL-lambda-sigma: an intentional first-order expression of higher-order logic, in: Mathematical Structures in Computer Science, 2001, vol. 11, p. 1-25.
• 6G. Dowek, T. Hardin, C. Kirchner.
  
  Theorem proving modulo, in: Journal of Automated Reasoning, 2003, vol. 31, p. 33-73.
• 7G. Dowek, B. Werner.
  
  Proof normalization modulo, in: The Journal of Symbolic Logic, 2003, vol. 68, n^o 4, p. 1289-1316.
• 8C. 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, p. 33-48.
• 9O. Hermant.
  
  Resolution is Cut-Free, in: Journal of Automated Reasoning, March 2010, vol. 44, n^o 3, p. 245-276.
• 10M. Jacquel, K. Berkani, D. Delahaye, C. Dubois.
  
  Verifying B Proof Rules Using Deep Embedding and Automated Theorem Proving, in: Software Engineering and Formal Methods - 9th International Conference, SEFM 2011, Montevideo, Uruguay, November 14-18, 2011. Proceedings, G. Barthe, A. Pardo, G. Schneider (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 7041, p. 253-268.

Articles in International Peer-Reviewed Journals

• 11P. Arrighi, G. Dowek.
  
  The physical Church-Turing thesis and the principles of quantum theory, in: International Journal of Foundations of Computer Science, 2012, vol. 23, n^o 5, 10.1142/S0129054112500153.
• 12P. Arrighi, G. Dowek.
  
  Causal Graph Dynamics, in: Information and Computation, 2013, vol. 223, p. 78-93, 10.1016/j.ic.2012.10.019.
• 13P. Arrighi, A. Díaz-Caro.
  
  A System F accounting for scalars, in: Logical Methods in Computer Science, 2012, vol. 8, n^o 1:11.
• 14G. Dowek.
  
  Non determinisitic computation over the real numbers, in: Philosophical Transactions of the Royal Society A, 2012, vol. 370, n^o 1971, p. 3349-3358, 10.1098/rsta.2011.0322.
• 15G. Dowek.
  
  The physical Church thesis as an explanation of the Galileo thesis, in: Natural Computing, 2012, 10.1007/s11047-011-9301-x.
• 16G. Dowek, M. J. Gabbay.
  
  PNL to HOL: From the logic of nominal sets to the logic of higher-order functions, in: Theoretical Computer Science, 2012, vol. 451, p. 38-69.
• 17G. Dowek, O. Hermant.
  
  A Simple Proof That Super-Consistency Implies Cut Elimination, in: Notre-Dame Journal of Formal Logic, 2012, vol. 53, n^o 4, p. 439-456.
  
  http://projecteuclid.org/euclid.ndjfl/1352383225
• 18A. Narkawicz, C. Muñoz, G. Dowek.
  
  Provably Correct Conflict Prevention Bands Algorithms, in: Science of Computer Programming, 2012, 10.1016/j.scico.2011.07.002.

International Conferences with Proceedings

• 19P. Arrighi, A. Díaz-Caro, B. Valiron.
  
  A type system for the vectorial aspects of the linear-algebraic lambda-calculus, in: Proceedings of the 7th International Workshop on Developments of Computational Methods (DCM 2011), E. Kashefi, J. Krivine, F. van Raamsdonk (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2012, vol. 88, p. 1–15.
• 20P. Ayrault, V. Benayoun, C. Dubois, F. Pessaux.
  
  ML Dependency Analysis for Assessors, in: Software Engineering and Formal Methods - 10th International Conference, SEFM 2012 2012. Proceedings, Thessaloniki, Greece, G. Eleftherakis, M. Hinchey, M. Holcombe (editors), Lecture Notes in Computer Science, Springer, October 1-5 2012, vol. 7504, p. 278-292.
• 21M. Boespflug, G. Burel.
  
  CoqInE: Translating the Calculus of Inductive Constructions into the $\lambda \Pi$-calculus Modulo, in: Second International Workshop on Proof Exchange for Theorem Proving, D. Pichardie, T. Weber (editors), 2012.
• 22M. Boespflug, Q. Carbonneaux, O. Hermant.
  
  The $\lambda \Pi$-calculus Modulo as a Universal Proof Language, in: Second Workshop on Proof Exchange for Theorem Proving (PxTP), CEUR-WS.org, 2012, vol. 878, Available at: ceur-ws.org/Vol-878/paper2.pdf.
• 23P. Buiras, A. Díaz-Caro, M. Jaskelioff.
  
  Confluence via strong normalisation in an algebraic $\lambda$-calculus with rewriting, in: Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2011), S. Ronchi della Rocca, E. Pimentel (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2012, vol. 81, p. 16–29.
• 24M. Carlier, C. Dubois, A. Gotlieb.
  
  A Certified Constraint Solver over Finite Domains, in: FM 2012: Formal Methods - 18th International Symposium, Paris, France, D. Giannakopoulou, D. Méry (editors), Lecture Notes in Computer Science, Springer, August 27-31 2012, vol. 7436, p. 116-131.
• 25M. Carlier, C. Dubois, A. Gotlieb.
  
  A First Step in the Design of a Formally Verified Constraint-Based Testing Tool: FocalTest, in: Tests and Proofs - 6th International Conference, TAP 2012, Prague, Czech Republic, A. D. Brucker, J. Julliand (editors), Lecture Notes in Computer Science, Springer, May 31 - June 1 2012, vol. 7305, p. 35-50.
• 26D. Cousineau, O. Hermant.
  
  A Semantic Proof that Reducibility Candidates entail Cut Elimination, in: RTA, A. Tiwari (editor), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012, vol. 15, p. 133-148.
• 27G. Dowek.
  
  A theory independent Curry-De Bruijn-Howard correspondence, in: International Colloquium on Automata, Languages and Programming, 2012, invited talk.
• 28G. Dowek.
  
  Around the physical Church-Turing thesis: cellular automata, formal languages, and the principles of quantum theory, in: Language and Automata Theory and Applications, Lecture Notes in Computer Science, 2012, vol. 7183, p. 21-37.
• 29G. Dowek, M. J. Gabbay.
  
  Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits, in: Italian Convention of Computational Logic, 2012.
• 30A. Díaz-Caro, G. Dowek.
  
  Non determinism through type isomophism, in: Proceedings of the 7th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2012), Rio de Janeiro, Brazil, 2012, To appear in EPTCS. Preprint at http://www.diaz-caro.info/ndti.pdf.
• 31A. Díaz-Caro, G. Manzonetto, M. Pagani.
  
  Call-by-value non-determinism in a linear logic type discipline, in: Logical Foundations of Computer Science, International Symposium, (LFCS 2013), S. Artemov, A. Nerode (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2013, vol. 7734, p. 164–178, To appear. Preprint at http://www.diaz-caro.info/dmp12.pdf.
• 32A. Díaz-Caro, B. Petit.
  
  Linearity in the non-deterministic call-by-value setting, in: Logic, Language, Information and Computation, L. Ong, R. de Queiroz (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2012, vol. 7456, p. 216–231.
• 33M. Jacquel, K. Berkani, D. Delahaye, C. Dubois.
  
  Tableaux Modulo Theories Using Superdeduction - An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover, in: Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, Lecture Notes in Computer Science, Springer, June 26-29 2012, vol. 7364, p. 332-338.
• 34T. G. Le, O. Hermant, M. Manceny, R. Pawlak, R. Rioboo.
  
  Unifying Event-based and Rule-based Styles to Develop Concurrent and Context-aware Reactive Applications - Toward a Convenient Support for Concurrent and Reactive Programming, in: ICSOFT, S. Hammoudi, M. van Sinderen, J. Cordeiro (editors), SciTePress, 2012, p. 347-350.
• 35P. Néron.
  
  A Formal Proof of Square Root and Division Elimination in Embedded Programs, in: Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, C. Hawblitzel, D. Miller (editors), Lecture Notes in Computer Science, Springer, December 13-15 2012, vol. 7679, p. 256-272.
• 36P.-N. Tollitte, D. Delahaye, C. Dubois.
  
  Producing Certified Functional Code from Inductive Specifications, in: Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, C. Hawblitzel, D. Miller (editors), Lecture Notes in Computer Science, Springer, December 13-15 2012, vol. 7679, p. 76-91.

Conferences without Proceedings

• 37G. Dowek.
  
  Chaos and the principle of a bounded density of information, in: Physics and computation, 2012.

Scientific Books (or Scientific Book chapters)

• 38P. Arrighi, G. Dowek.
  
  The principle of a finite density of information, in: Irreducibility and Computational Equivalence: Wolfram Science 10 Years After the Publication of A New Kind of Science, H. Zenil (editor), Springer-Verlag, 2012.
• 39G. Dowek, e. al..
  
  Informatique et sciences du numérique - Spécialité ISN en terminale S, Eyrolles, 2012.

Other Publications

• 40A. Assaf.
  
  Traduction de HOL en Dedukti, MPRI, 2012.
• 41R. Bost.
  
  Nombres réels et transformation de programmes, École polytechnique, 2012.
• 42G. Burel.
  
  From Axioms to Rewriting Rules, 2012, manuscript.
• 43Q. Carbonneaux.
  
  Compilation JIT des termes de preuve, MPRI, 2012.
• 44R. Cauderlier.
  
  Object-Oriented Features in lambda-Pi-calculus modulo, Compiling FoCaLize to Dedukti, MPRI, 2012.
• 45N. Dershowitz, G. Dowek.
  
  Universality in Two Dimensions, 2012, manuscript.
• 46G. Dowek.
  
  On the definition of the classical connectives and quantifiers, 2012, manuscript.

• 47Y. Bertot, P. Castéran.
  
  Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer-Verlag, 2004.
• 48R. Gandy.
  
  Church's Thesis and Principles for Mechanisms, in: The Kleene Symposium, North-Holland, 1980.
• 49R. Harper, F. Honsell, G. Plotkin.
  
  A Framework for Defining Logics, in: Journal of the association for computing machinery, 1993, p. 194–204.
• 50J. 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, p. 60-66.
  
  http://dx.doi.org/10.1007/978-3-642-03359-9_4
• 51J. Hurd.
  
  The OpenTheory Standard Theory Library, in: NASA Formal Methods, M. Bobaru, K. Havelund, G. Holzmann, R. Joshi (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2011, vol. 6617, p. 177-191.
  
  http://dx.doi.org/10.1007/978-3-642-20398-5_14
• 52K. Korovin.
  
  iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description), in: IJCAR, A. Armando, P. Baumgartner (editors), Lecture Notes in Artificial Intelligence, Springer, 2008, vol. 5195, p. 292-298.
• 53P. Martin-Löf.
  
  Intuitionistic Type Theory, Bibliopolis, 1984.
• 54D. Prawitz.
  
  Natural Deduction: A Proof-Theoretical Study, Almquist and Wiksell, 1965.