Team TypiCal

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Dissemination
Bibliography

Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

[1]
D. Cousineau.
Modèles et normalisation des preuves, Ecole Polytechnique X, 12 2009
http://tel.archives-ouvertes.fr/tel-00433165/en/, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[2]
G. Dowek.
On the convergence of reduction-based and model-based methods in proof theory, in: Logic Journal of the Interest Group in Pure and Applied Logic, 2009.
[3]
G. Dowek.
Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View, in: Studies in Logic and the Foundations of Mathematics., 2009.

International Peer-Reviewed Conference/Proceedings

[4]
B. Barras.
Sets in Coq, Coq in Sets, in: The first international Coq workshop, H. Herbelin (editor), August 2009.
[5]
M. Boespflug.
Efficient normalization by evaluation, in: 2009 Workshop on Normalization by Evaluation, Los Angeles États-Unis d'Amérique, O. Danvy (editor), Olivier Danvy, 08 2009
http://hal.inria.fr/inria-00434283/en/.
[6]
M. Boespflug.
From Self-Interpreters to Normalization by Evaluation, in: 2009 Workshop on Normalization by Evaluation, Los Angeles États-Unis d'Amérique, O. Danvy (editor), Olivier Danvy, 08 2009
http://hal.inria.fr/inria-00434284/en/.
[7]
M. Boespflug.
Conversion by Evaluation, in: Twelfth International Symposium on Practical Aspects of Declarative Languages, Madrid Espagne, 01 2010
http://hal.inria.fr/inria-00434282/en/.
[8]
D. Cousineau.
Complete reducibility candidates, in: Proof Search in Type Theory, Montréal Canada, 08 2009
http://hal.inria.fr/inria-00433159/en/.
[9]
G. Dowek, M. Gabbay, D. Mulligan.
Permissive nominal terms and their unification, in: 24th Italian Conference on Computational Logic, 2009.
[10]
F. Garillot, G. Gonthier, A. Mahboubi, L. Rideau.
Packaging Mathematical Structures, in: Theorem Proving in Higher Order Logics, Munich Allemagne, T. Nipkow, C. Urban (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5674
http://hal.inria.fr/inria-00368403/en/.
[11]
J. Maddalon, R. Butler, C. Munoz, G. Dowek.
A Mathematical Analysis of Conflict Prevention Information, in: 9th AIAA Aviation Technology, Integration, and Operations Conference, 2009.

Scientific Books (or Scientific Book chapters)

[12]
H. Herbelin (editor)
The 1st Coq Workshop, August 2009.

Internal Reports

[13]
G. Dowek, C. Munoz, C. Rocha.
Rewriting Logic Semantics of a Plan Execution Language, NASA, 2009, no NASA TM-2009-215770, Under submission.
[14]
G. Faure.
Encoding rewriting strategies in lambda-calculi with patterns, INRIA, 2009, no RR-7025
http://hal.inria.fr/inria-00413178/en/, Research Report.
[15]
G. Faure.
Higher-order matching modulo (super)developements. Applications to second-order matching, INRIA Saclay Île-de-France, 2009
http://hal.inria.fr/inria-00429978/en/, Research Report.
[16]
G. Faure, A. Miquel.
A Categorical Semantics for The Parallel Lambda-Calculus, INRIA, 2009, no RR-7063
http://hal.inria.fr/inria-00424248/en/, Research Report.
[17]
G. Gonthier, A. Mahboubi.
A Small Scale Reflection Extension for the Coq system (v2.), INRIA, 2009, no RR-6455
http://hal.inria.fr/inria-00258384/en/, Research Report.

Other Publications

[18]
D. Cousineau.
A completeness theorem for strong normalization in minimal deduction modulo, 2009
http://hal.inria.fr/inria-00370379/en/, Under submission.
[19]
D. Cousineau.
A semantic method to prove strong normalization from weak normalization, 2009
http://hal.inria.fr/inria-00385520/en/, Under submission.
[20]
G. Dowek, G. Burel.
How can we prove that a proof search method is not an instance of another?, 2009, Under submission.
[21]
G. Dowek.
Polarized Resolution Modulo, 2009, Under submission.
[22]
G. Dowek.
Simple Type Theory as a Clausal Theory, 2009, Under submission.
[23]
G. Dowek.
Specifying programs with propositions and with congruences, 2009, Under submission.

previous
next