Bibliography

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.

https://hal-mines-paristech.archives-ouvertes.fr/hal-01441751
2B. Barras, T. Coquand, S. Huber.

A generalization of the Takeuti-Gandy interpretation, in: Mathematical Structures in Computer Science, 2015, vol. 25, n^o 5, pp. 1071–1099.

https://doi.org/10.1017/S0960129514000504
3F. Blanqui.

Definitions by rewriting in the Calculus of Constructions, in: Mathematical Structures in Computer Science, 2005, vol. 15, n^o 1, pp. 37-92. [ DOI : 10.1017/S0960129504004426 ]

http://hal.inria.fr/inria-00105648/en/
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 ]

https://hal.inria.fr/hal-01163091
5V. Blot.

An interpretation of system F through bar recursion, in: 32nd ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2017.
6G. Burel, G. Bury, R. Cauderlier, D. Delahaye, P. Halmagrand, O. Hermant.

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice, in: Journal of Automated Reasoning, 2019. [ DOI : 10.1007/s10817-019-09533-z ]

https://hal.archives-ouvertes.fr/hal-02305831
7D. 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.
8G. Dowek, T. Hardin, C. Kirchner.

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

Resolution is Cut-Free, in: Journal of Automated Reasoning, March 2010, vol. 44, n^o 3, pp. 245-276.
10M. 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.
11M. 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 ]

https://hal.archives-ouvertes.fr/hal-01099338

Publications of the year

Articles in International Peer-Reviewed Journals

12G. Burel, G. Bury, R. Cauderlier, D. Delahaye, P. Halmagrand, O. Hermant.

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice, in: Journal of Automated Reasoning, 2019, forthcoming. [ DOI : 10.1007/s10817-019-09533-z ]

https://hal.archives-ouvertes.fr/hal-02305831
13Y. Jiang, J. Liu, G. Dowek, K. Ji.

Towards Combining Model Checking and Proof Checking, in: The Computer Journal, 2019, forthcoming. [ DOI : 10.1093/comjnl/bxy112 ]

https://hal.inria.fr/hal-01970274

International Conferences with Proceedings

14F. Blanqui, G. Genestier, O. Hermant.

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting, in: FSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Dortmund, Germany, June 2019, https://arxiv.org/abs/1906.11649. [ DOI : 10.4230/LIPIcs.FSCD.2019.9 ]

https://hal.inria.fr/hal-01943941
15F. Blanqui, G. Genestier, O. Hermant.

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting, in: TYPES 2019 - 25th International Conference on Types for Proofs and Programs, Oslo, Norway, M. Bezem, N. van der Weide (editors), June 2019, pp. 30-31.

https://hal.archives-ouvertes.fr/hal-02442484
16M. Y. El Haddad, G. Burel, F. Blanqui.

Ekstrakto A tool to reconstruct Dedukti proofs from TSTP files (extended abstract), in: PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, Natal, Brazil, Electronic Proceedings in Theoretical Computer Science, August 2019, vol. 301, pp. 27-35. [ DOI : 10.4204/EPTCS.301.5 ]

https://hal.inria.fr/hal-02200548
17G. Genestier.

SizeChangeTool: A Termination Checker for Rewriting Dependent Types, in: HOR 2019 - 10th International Workshop on Higher-Order Rewriting, Dortmund, Germany, M. Ayala-Rincón, S. Ghilezan, J. G. Simonsen (editors), Joint Proceedings of HOR 2019 and IWC 2019, June 2019, pp. 14-19.

https://hal.archives-ouvertes.fr/hal-02442465

National Conferences with Proceedings

18S. Colin, R. Lepigre, G. Scherer.

Unboxing Mutually Recursive Type Definitions in OCaml, in: JFLA 2019 - 30 èmes journées francophones des langages applicatifs, Les Rousses, France, January 2019, https://arxiv.org/abs/1811.02300.

https://hal.inria.fr/hal-01929508

Conferences without Proceedings

19F. Thiré.

Cumulative Types Systems and Levels, in: LFMTP 2019 - Logical Frameworks and Meta-Languages: Theory and Practice, Vancouver, Canada, June 2019.

https://hal.archives-ouvertes.fr/hal-02150179

Other Publications

20G. Ferey, J.-P. Jouannaud.

Confluence in (Un)Typed Higher-Order Theories by means of Critical Pairs, December 2019, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-02096540
21F. Gilbert.

Verifiable certificates for predicate subtyping, January 2019, working paper or preprint.

https://hal.inria.fr/hal-01977585
22G. Hondet.

Efficient rewriting using decision trees, ENAC ; Univesité Toulouse III- Paul Sabatier, August 2019.

https://hal.inria.fr/hal-02317471
23J.-H. Wu.

Checking the type safety of rewrite rules in the $λ Π$ -calculus modulo rewriting, Ecole Normale Supérieure, September 2019.

https://hal.inria.fr/hal-02288720

References in notes

24M. Boespflug.

Conception d'un noyau de vérification de preuves pour le $λ Π$ -calcul modulo, École Polytechnique, 2011.
25G. 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.

http://dx.doi.org/10.1007/978-3-642-31585-5_2

Previous |

Home