Team Gallium

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

Bibliography

Major publications by the team in recent years

[1]
T. Hirschowitz, X. Leroy.
Mixin modules in a call-by-value setting, in: ACM Transactions on Programming Languages and Systems, 2005, vol. 27, no 5, p. 857–881
http://gallium.inria.fr/~xleroy/publi/mixins-cbv-toplas.pdf.
[2]
D. Le Botlan, D. Rémy.
MLF: Raising ML to the power of System F, in: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ACM Press, August 2003, p. 27–38
http://gallium.inria.fr/~remy/work/mlf/icfp.pdf.
[3]
X. Leroy.
A modular module system, in: Journal of Functional Programming, 2000, vol. 10, no 3, p. 269–303
http://gallium.inria.fr/~xleroy/publi/modular-modules-jfp.ps.gz.
[4]
X. Leroy.
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, in: 33rd ACM symposium on Principles of Programming Languages, ACM Press, 2006, p. 42–54
http://gallium.inria.fr/~xleroy/publi/compiler-certif.pdf.
[5]
F. Pottier.
A Versatile Constraint-Based Type Inference System, in: Nordic Journal of Computing, 2000, vol. 7, no 4, p. 312–347.
[6]
F. Pottier.
Simplifying subtyping constraints: a theory, in: Information & Computation, 2001, vol. 170, no 2, p. 153–183.
[7]
F. Pottier, D. Rémy.
The Essence of ML Type Inference, in: Advanced Topics in Types and Programming Languages, B. C. Pierce (editor), MIT Press, 2005, chap. 10, p. 389–489.
[8]
F. Pottier, V. Simonet.
Information Flow Inference for ML, in: ACM Transactions on Programming Languages and Systems, January 2003, vol. 25, no 1, p. 117–158
http://gallium.inria.fr/~fpottier/publis/fpottier-simonet-toplas.ps.gz.
[9]
D. Rémy.
Using, Understanding, and Unraveling the OCaml Language, in: Applied Semantics. Advanced Lectures, G. Barthe (editor), Lecture Notes in Computer Science, Springer-Verlag, 2002, vol. 2395, p. 413–537.

Publications of the year

Doctoral dissertations and Habilitation theses

[10]
R. Bonichon.
Tableaux et Déduction Modulo, Ph. D. Thesis, University Paris 6, December 2006.

Articles in refereed journals and book chapters

[11]
E. Chailloux, M. Mauny.
Programmation fonctionnelle, in: Encyclopédie des systèmes d'information, Éditions Vuibert, 2006, p. 1016–1027.
[12]
F. Pottier, N. Gauthier.
Polymorphic Typed Defunctionalization and Concretization, in: Higher-Order and Symbolic Computation, March 2006, vol. 19, no 1, p. 125–162
http://gallium.inria.fr/~fpottier/publis/fpottier-gauthier-hosc.pdf.

Publications in Conferences and Workshops

[13]
A. W. Appel, X. Leroy.
A list-machine benchmark for mechanized metatheory, in: Proc. Int. Workshop on Logical Frameworks and Meta-Languages (LFMTP'06), Electronic Notes in Theoretical Computer Science, 2006
http://gallium.inria.fr/~xleroy/publi/listmachine-lfmtp.pdf.
[14]
Y. Bertot, B. Grégoire, X. Leroy.
A structured approach to proving compiler optimizations based on dataflow analysis, in: Types for Proofs and Programs, Workshop TYPES 2004, Lecture Notes in Computer Science, Springer-Verlag, 2006, vol. 3839, p. 66-81
http://gallium.inria.fr/~xleroy/publi/proofs_dataflow_optimizations.pdf.
[15]
S. Blazy, Z. Dargaye, X. Leroy.
Formal Verification of a C Compiler Front-End, in: FM 2006: Int. Symp. on Formal Methods, Lecture Notes in Computer Science, Springer-Verlag, 2006, vol. 4085, p. 460–475
http://gallium.inria.fr/~xleroy/publi/cfront.pdf.
[16]
J. Boender, R. Di Cosmo, B. Durak, X. Leroy, F. Mancinelli, M. Morgado, D. Pinheiro, R. Treinen, P. Trezentos, J. Vouillon.
News from the EDOS project: improving the maintenance of free software distributions, in: VIIth Workshop on Free Software, 2006
http://www.edos-project.org/xwiki/bin/download/Main/Publications/wsl06.pdf.
[17]
R. Bonichon, O. Hermant.
A semantic completeness proof for TaMeD, in: Logic for programming, artificial intelligence, and reasoning, LPAR 2006, Lecture Notes in Artificial Intelligence, Springer-Verlag, 2006, vol. 4246, p. 167–181.
[18]
R. Bonichon, O. Hermant.
On Constructive Cut Admissibility in Deduction Modulo, in: TYPES 2006 conference, Lecture Notes in Computer Science, Accepted for publication in the post-workshop proceedings, Springer-Verlag, 2006.
[19]
Z. Dargaye.
Décurryfication certifiée, in: Journées Francophones des Langages Applicatifs (JFLA'07), Accepted for publication, to appear, INRIA, 2007.
[20]
R. Di Cosmo, B. Durak, X. Leroy, F. Mancinelli, J. Vouillon.
Maintaining large software distributions: new challenges from the FOSS era, in: Proceedings of the FRCSS 2006 workshop, 2006
http://gallium.inria.fr/~xleroy/publi/edos-frcss06.pdf.
[21]
A. Frisch.
OCaml + XDuce, in: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ACM Press, September 2006, p. 192–200
http://doi.acm.org/10.1145/1159803.1159829.
[22]
A. Frisch.
OCaml + XDuce, in: Workshop Programming Language Technologies for XML (PLAN-X) 2006, January 2006.
[23]
A. Frisch, K. Nakano.
Streaming XML Transformations Using Term Rewriting, in: Workshop Programming Language Technologies for XML (PLAN-X 2007), To appear, January 2007.
[24]
G. Henry, M. Mauny, E. Chailloux.
Typer la dé-sérialisation sans sérialiser les types, in: Journées francophones des langages applicatifs, INRIA, January 2006.
[25]
X. Leroy.
Coinductive big-step operational semantics, in: European Symposium on Programming (ESOP'06), Lecture Notes in Computer Science, Springer-Verlag, 2006, vol. 3924, p. 54-68
http://gallium.inria.fr/~xleroy/publi/coindsem.pdf.
[26]
X. Leroy.
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, in: 33rd ACM symposium on Principles of Programming Languages, ACM Press, 2006, p. 42–54
http://gallium.inria.fr/~xleroy/publi/compiler-certif.pdf.
[27]
F. Mancinelli, R. Di Cosmo, J. Vouillon, J. Boender, B. Durak, X. Leroy, R. Treinen.
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions, in: 21st IEEE Int. Conf. on Automated Software Engineering (ASE 2006), IEEE Computer Society Press, 2006, p. 199–208
http://doi.ieeecomputersociety.org/10.1109/ASE.2006.49.
[28]
F. Pottier, Y. Régis-Gianas.
Stratified type inference for generalized algebraic data types, in: 33rd ACM symposium on Principles of Programming Languages, ACM Press, January 2006, p. 232–244
http://gallium.inria.fr/~fpottier/publis/pottier-regis-gianas-05.pdf.
[29]
D. Rémy, B. Yakobowski.
A graphical presentation of MLF types with a linear-time incremental unification algorithm., in: ACM SIGPLAN Workshop on Types in Language Design and Implementation, To appear, ACM Press, January 2007
http://pauillac.inria.fr/~remy/publications.html#Remy/mlf-graphic-types.

Internal Reports

[30]
A. W. Appel, X. Leroy.
A list-machine benchmark for mechanized metatheory, Research report, INRIA, 2006, no 5914
http://hal.inria.fr/inria-00077531.

Miscellaneous

[31]
A. W. Appel, S. Blazy.
Separation Logic for Small-step C Minor, Draft, October 2006
http://gallium.inria.fr/~blazy/AppelBlazy06.pdf.
[32]
F. Pottier.
Static Name Control for FreshML, Draft, July 2006
http://gallium.inria.fr/~fpottier/publis/fpottier-pure-freshml.pdf.
[33]
D. Rémy, B. Yakobowski.
A graphical presentation of MLF types with a linear-time incremental unification algorithm., Extended version of the TLDI'07 article, September 2006
http://gallium.inria.fr/~remy/project/mlf.
[34]
J.-B. Tristan.
Certification d'un validateur de transformations, Master's dissertation (mémoire de stage de Master 2), ENS Paris, September 2006
http://gallium.inria.fr/~tristan/rapport.pdf.

References in notes

[35]
V. Benzaken, G. Castagna, A. Frisch.
CDuce: an XML-centric general-purpose language, in: Int. Conf. on Functional programming (ICFP'03), ACM Press, 2003, p. 51–63.
[36]
J.-C. Filliâtre, C. Marché.
Multi-Prover Verification of C Programs, in: Sixth International Conference on Formal Engineering Methods (ICFEM), Lecture Notes in Computer Science, Springer-Verlag, 2004, vol. 3308, p. 15–29.
[37]
H. Hosoya, B. C. Pierce.
XDuce: A Statically Typed XML Processing Language, in: ACM Transactions on Internet Technology, May 2003, vol. 3, no 2, p. 117–148.
[38]
L. Lamport.
How to write a proof, in: American Mathematical Monthly, August 1993, vol. 102, no 7, p. 600–608.
[39]
D. Le Botlan.
MLF: Une extension de ML avec polymorphisme de second ordre et instanciation implicite., Ph. D. Thesis, École Polytechnique, May 2004
http://www.inria.fr/rrrt/tu-1071.html.
[40]
X. Leroy, D. Doligez, J. Garrigue, D. Rémy, J. Vouillon.
The Objective Caml system, documentation and user's manual – release 3.09, INRIA, October 2005
http://caml.inria.fr/pub/docs/manual-ocaml/.
[41]
G. C. Necula, S. McPeak, S. P. Rahul, W. Weimer.
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs, in: Compiler Construction : 11th International Conference, CC 2002, Lecture Notes in Computer Science, Springer-Verlag, 2002, vol. 2304, p. 213-228.
[42]
G. C. Necula.
Translation validation for an optimizing compiler, in: Programming Language Design and Implementation 2000, ACM Press, 2000, p. 83–95.
[43]
B. C. Pierce.
Types and Programming Languages, MIT Press, 2002.
[44]
F. Pottier.
Simplifying subtyping constraints: a theory, in: Information & Computation, 2001, vol. 170, no 2, p. 153–183.
[45]
F. Pottier.
An overview of C$ \alpha$ ml, in: ACM Workshop on ML, Electronic Notes in Theoretical Computer Science, September 2005, vol. 148(2), p. 27–52
http://gallium.inria.fr/~fpottier/publis/fpottier-alphacaml.pdf.
[46]
V. Prevosto, D. Doligez.
Algorithms and Proofs Inheritance in the FOC Language, in: Journal of Automated Reasoning, 2002, vol. 29, no 3–4, p. 337-363.
[47]
D. Rémy, J. Vouillon.
Objective ML: A simple object-oriented extension to ML, in: 24th ACM Conference on Principles of Programming Languages, ACM Press, 1997, p. 40–53.

previous
next