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, 2002, vol. 2395, p. 413–537.

Publications of the year

Articles in refereed journals and book chapters

[10]
S. Blazy.
Comment gagner confiance en C ?, in: Technique et Science Informatiques, 2007, vol. 26, no 9, p. 1195-1200
http://www.ensiie.fr/~blazy/TSI07Blazy.pdf.
[11]
V. Simonet, F. Pottier.
A Constraint-Based Approach to Guarded Algebraic Data Types, in: ACM Transactions on Programming Languages and Systems, January 2007, vol. 29, no 1, article no. 1 p
http://gallium.inria.fr/~fpottier/publis/simonet-pottier-hmg-toplas.ps.gz.

Publications in Conferences and Workshops

[12]
A. W. Appel, S. Blazy.
Separation logic for small-step Cminor, in: Theorem Proving in Higher Order Logics, 20th Int. Conf. TPHOLs 2007, Lecture Notes in Computer Science, Springer, 2007, vol. 4732, p. 5–21
http://www.ensiie.fr/~blazy/AppelBlazy07.pdf.
[13]
A. W. Appel, X. Leroy.
A list-machine benchmark for mechanized metatheory (extended abstract), in: Proc. Int. Workshop on Logical Frameworks and Meta-Languages (LFMTP'06), Electronic Notes in Computer Science, 2007, vol. 174(5), p. 95–108
http://dx.doi.org/10.1016/j.entcs.2007.01.020.
[14]
S. Blazy.
Experiments in validating formal semantics for C, in: Proceedings of the C/C++ Verification Workshop, Technical report ICIS-R07015, Radboud University Nijmegen, 2007, p. 95–102
http://www.ensiie.fr/~blazy/C07Blazy.pdf.
[15]
S. Blazy, B. Robillard, É. Soutif.
Coloration avec préférences dans les graphes triangulés, in: Journées Graphes et Algorithmes (JGA'07), nov 2007
http://www.ensiie.fr/~blazy/JGA07.pdf.
[16]
R. Bonichon, D. Delahaye, D. Doligez.
Zenon: an Extensible Automated Theorem Prover Producing Checkable Proofs, in: Logic for Programming, Artificial Intelligence and Reasoning, 14th Int. Conf. LPAR 2007, Lecture Notes in Artificial Intelligence, Springer, 2007, vol. 4790, p. 151–165
http://focal.inria.fr/zenon/zenlpar07.pdf.
[17]
R. Bonichon, O. Hermant.
On Constructive Cut Admissibility in Deduction Modulo, in: Types for Proofs and Programs, International Workshop, TYPES 2006, Revised Selected Papers, Lecture Notes in Computer Science, Springer, 2007, vol. 4502, p. 33-47
http://dx.doi.org/10.1007/978-3-540-74464-1_3.
[18]
Z. Dargaye.
Décurryfication certifiée, in: Journées Francophones des Langages Applicatifs (JFLA'07), INRIA, 2007, p. 119–134
http://gallium.inria.fr/~dargaye/publications/certdec.pdf.
[19]
Z. Dargaye, X. Leroy.
Mechanized verification of CPS transformations, in: Logic for Programming, Artificial Intelligence and Reasoning, 14th Int. Conf. LPAR 2007, Lecture Notes in Artificial Intelligence, Springer, 2007, vol. 4790, p. 211–225
http://gallium.inria.fr/~xleroy/publi/cps-dargaye-leroy.pdf.
[20]
A. Frisch, H. Hosoya.
Towards Practical Typechecking for Macro Tree Transducers, in: Database Programming Languages, 11th International Symposium, DBPL 2007, Lecture Notes in Computer Science, Springer, 2007, vol. 4797, p. 246–260
http://dx.doi.org/10.1007/978-3-540-75987-4_17.
[21]
A. Frisch, K. Nakano.
Streaming XML Transformations Using Term Rewriting, in: Workshop Programming Language Technologies for XML (PLAN-X 2007), January 2007, p. 2–13
http://www.plan-x-2007.org/plan-x-2007.pdf.
[22]
P. Li, S. Marlow, S. Peyton Jones, A. Tolmach.
Lightweight concurrency primitives for GHC, in: Haskell '07: Proceedings of the ACM SIGPLAN workshop on Haskell, ACM Press, 2007, p. 107–118
http://doi.acm.org/10.1145/1291201.1291217.
[23]
F. Pottier.
Static Name Control for FreshML, in: Twenty-Second Annual IEEE Symposium on Logic In Computer Science (LICS'07), IEEE Computer Society Press, July 2007, p. 356–365
http://gallium.inria.fr/~fpottier/publis/fpottier-pure-freshml.ps.gz.
[24]
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, ACM Press, January 2007, p. 27–38
http://gallium.inria.fr/~remy/project/mlf/mlf-graphic-types.pdf.

Internal Reports

[25]
A. W. Appel, S. Blazy.
Separation logic for small-step Cminor (extended version), Research report, INRIA, 2007, no 6138
http://hal.inria.fr/inria-00134699/.
[26]
D. Le Botlan, D. Rémy.
Recasting MLF, Research report, INRIA, June 2007, no 6228
http://hal.inria.fr/inria-00156628.
[27]
X. Leroy.
A locally nameless solution to the POPLmark challenge, Research report, INRIA, January 2007, no 6098
http://hal.inria.fr/inria-00123945.

Miscellaneous

[28]
A. Charguéraud.
Proof of imperative programs, Master's dissertation (mémoire de stage de Master 2), ENS Lyon, September 2007.
[29]
B. Montagu.
Modules de première classe, Master's dissertation (mémoire de stage de Master 2), École Polytechnique, September 2007
http://gallium.inria.fr/~montagu/publications/2007/modules.pdf.
[30]
T. Ramananandro.
Vérification formelle d'une implémentation d'un gestionnaire de mémoire pour un compilateur certifié, Master's dissertation (mémoire de stage de Master 2), ENS Paris, September 2007
http://www.eleves.ens.fr/~ramanana/travail/gc.

References in notes

[31]
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.
[32]
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, 2006, vol. 4085, p. 460–475
http://gallium.inria.fr/~xleroy/publi/cfront.pdf.
[33]
J.-C. Filliâtre, P. Letouzey.
Functors for Proofs and Programs, in: Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004, Lecture Notes in Computer Science, Springer, 2004, vol. 2986, p. 370-384.
[34]
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.
[35]
L. Lamport.
How to write a proof, in: American Mathematical Monthly, August 1993, vol. 102, no 7, p. 600–608
http://research.microsoft.com/users/lamport/pubs/lamport-how-to-write.pdf.
[36]
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.
[37]
G. C. Necula.
Translation validation for an optimizing compiler, in: Programming Language Design and Implementation 2000, ACM Press, 2000, p. 83–95.
[38]
B. C. Pierce.
Types and Programming Languages, MIT Press, 2002.
[39]
F. Pottier.
Simplifying subtyping constraints: a theory, in: Information & Computation, 2001, vol. 170, no 2, p. 153–183.
[40]
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.
[41]
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.
[42]
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