Publications by François Pottier

[1] François Pottier. Hindley-Milner elaboration in applicative style. In Proceedings of the 2014 ACM SIGPLAN International Conference on Functional Programming (ICFP'14), September 2014. [ bib | PDF | At publisher's | Abstract ]
[2] Thibaut Balabonski, François Pottier, and Jonathan Protzenko. The design and formalization of Mezzo, a permission-based programming language. Submitted for publication, July 2014. [ bib | PDF | Abstract ]
[3] Thibaut Balabonski, François Pottier, and Jonathan Protzenko. Type soundness and race freedom for Mezzo. In Proceedings of the 12th International Symposium on Functional and Logic Programming (FLOPS 2014), volume 8475, pages 253-269, June 2014. [ bib | PDF | At publisher's | Abstract ]
[4] François Pottier and Jonathan Protzenko. Programming with permissions in Mezzo. In Proceedings of the 2013 ACM SIGPLAN International Conference on Functional Programming (ICFP'13), pages 173-184, September 2013. [ bib | PDF | Long PDF | At publisher's | Abstract ]
[5] Armaël Guéneau, François Pottier, and Jonathan Protzenko. The ins and outs of iteration in Mezzo. Talk proposal for HOPE 2013, July 2013. [ bib | PDF | Abstract ]
[6] Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, and Hongseok Yang. A step-indexed Kripke model of hidden state. Mathematical Structures in Computer Science, 23(1):1-54, February 2013. [ bib | PDF | At publisher's ]
[7] François Pottier. Syntactic soundness proof of a type-and-capability system with hidden state. Journal of Functional Programming, 23(1):38-144, January 2013. [ bib | PDF | At publisher's | Abstract ]
[8] Nicolas Pouillard and François Pottier. A unified treatment of syntax with binders. Journal of Functional Programming, 22(4-5):614-704, September 2012. [ bib | PDF | At publisher's | Abstract ]
[9] Jacques-Henri Jourdan, François Pottier, and Xavier Leroy. Validating LR(1) parsers. In Proceedings of the 21st European Symposium on Programming (ESOP 2012), volume 7211 of Lecture Notes in Computer Science, pages 397-416. Springer, March 2012. [ bib | PDF | At publisher's | Abstract ]
[10] Alexandre Pilkiewicz and François Pottier. The essence of monotonic state. In Proceedings of the Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'11), Austin, Texas, January 2011. [ bib | PDF | At publisher's | Abstract ]
[11] François Pottier. A typed store-passing translation for general references. In Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL'11), Austin, Texas, January 2011. Supplementary material. [ bib | PDF | Long PDF | At publisher's | Abstract ]
[12] Nicolas Pouillard and François Pottier. A fresh look at programming with names and binders. In Proceedings of the fifteenth ACM SIGPLAN International Conference on Functional Programming (ICFP 2010), pages 217-228, September 2010. [ bib | PDF | Long PDF | At publisher's | Abstract ]
[13] Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, and Bernhard Reus. A semantic foundation for hidden state. In C.-H. L. Ong, editor, Proceedings of the 13th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2010), volume 6014 of Lecture Notes in Computer Science, pages 2-17. Springer, March 2010. [ bib | PDF | At publisher's | Abstract ]
[14] François Pottier. Lazy least fixed points in ML. Unpublished, December 2009. [ bib | PDF | Abstract ]
[15] François Pottier. Three comments on the anti-frame rule. Unpublished, July 2009. [ bib | PDF | Abstract ]
[16] François Pottier. Generalizing the higher-order frame and anti-frame rules. Unpublished, July 2009. [ bib | PDF | Abstract ]
[17] Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. In Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP'08), pages 213-224, September 2008. [ bib | PDF | PostScript | At publisher's | Abstract ]
[18] Yann Régis-Gianas and François Pottier. A Hoare logic for call-by-value functional programs. In Proceedings of the Ninth International Conference on Mathematics of Program Construction (MPC'08), volume 5133 of Lecture Notes in Computer Science, pages 305-335. Springer, July 2008. [ bib | PDF | PostScript | At publisher's | Abstract ]
[19] François Pottier. Hiding local state in direct style: a higher-order anti-frame rule. In Twenty-Third Annual IEEE Symposium on Logic In Computer Science (LICS'08), pages 331-340, Pittsburgh, Pennsylvania, June 2008. [ bib | PDF | At publisher's | Abstract ]
[20] François Pottier. Static name control for FreshML. In Twenty-Second Annual IEEE Symposium on Logic In Computer Science (LICS'07), pages 356-365, Wroclaw, Poland, July 2007. [ bib | PDF | PostScript | Long PDF | Long PostScript | At publisher's | Abstract ]
[21] Vincent Simonet and François Pottier. A constraint-based approach to guarded algebraic data types. ACM Transactions on Programming Languages and Systems, 29(1), January 2007. [ bib | PDF | PostScript | At publisher's | Abstract ]
[22] François Pottier. An overview of Cαml. In ACM Workshop on ML, volume 148(2) of Electronic Notes in Theoretical Computer Science, pages 27-52, March 2006. [ bib | PDF | PostScript | At publisher's | Abstract ]
[23] François Pottier and Nadji Gauthier. Polymorphic typed defunctionalization and concretization. Higher-Order and Symbolic Computation, 19:125-162, March 2006. [ bib | PDF | PostScript | At publisher's | Abstract ]
[24] François Pottier and Yann Régis-Gianas. Towards efficient, typed LR parsers. In ACM Workshop on ML, volume 148(2) of Electronic Notes in Theoretical Computer Science, pages 155-180, March 2006. [ bib | PDF | PostScript | At publisher's | Abstract ]
[25] François Pottier and Yann Régis-Gianas. Stratified type inference for generalized algebraic data types. In Proceedings of the 33rd ACM Symposium on Principles of Programming Languages (POPL'06), pages 232-244, Charleston, South Carolina, January 2006. [ bib | PDF | PostScript | At publisher's | Abstract ]
[26] François Pottier and Yann Régis-Gianas. Menhir, December 2005. [ bib | Software ]
[27] François Pottier. A modern eye on ML type inference: old techniques and recent developments. Lecture notes for the APPSEM Summer School, September 2005. [ bib | PDF | PostScript ]
[28] François Pottier. Cαml, June 2005. [ bib | Software ]
[29] Roberto Di Cosmo, François Pottier, and Didier Rémy. Subtyping recursive types modulo associative commutative products. In Seventh International Conference on Typed Lambda Calculi and Applications (TLCA'05), volume 3461 of Lecture Notes in Computer Science, pages 179-193, Nara, Japan, April 2005. Springer. [ bib | PDF | PostScript | Long PDF | Long PostScript | At publisher's | Abstract ]
[30] François Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. ACM Transactions on Programming Languages and Systems, 27(2):344-382, March 2005. [ bib | PostScript | At publisher's | Abstract ]
[31] François Pottier and Didier Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389-489. MIT Press, 2005. A draft extended version is also available. [ bib | PDF | At publisher's ]
[32] Vincent Simonet and François Pottier. Constraint-based type inference for guarded algebraic data types. Research Report 5462, INRIA, January 2005. [ bib | PDF | PostScript | At publisher's | Abstract ]
[33] François Pottier. Types et contraintes. Mémoire d'habilitation à diriger des recherches, Université Paris 7, December 2004. [ bib | PDF | PostScript ]
[34] Nadji Gauthier and François Pottier. Numbering matters: First-order canonical forms for second-order recursive types. In Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming (ICFP'04), pages 150-161, September 2004. [ bib | PDF | PostScript | At publisher's | Abstract ]
[35] François Pottier and Nadji Gauthier. Polymorphic typed defunctionalization. In Proceedings of the 31st ACM Symposium on Principles of Programming Languages (POPL'04), pages 89-98, Venice, Italy, January 2004. Superseded by [23]. [ bib | PDF | PostScript | At publisher's | Abstract ]
[36] Jean-Christophe Filliâtre and François Pottier. Producing all ideals of a forest, functionally. Journal of Functional Programming, 13(5):945-956, September 2003. [ bib | PostScript | At publisher's | Abstract ]
[37] François Pottier. A constraint-based presentation and generalization of rows. In Eighteenth Annual IEEE Symposium on Logic In Computer Science (LICS'03), pages 331-340, Ottawa, Canada, June 2003. [ bib | PostScript | Long PostScript | At publisher's | Abstract ]
[38] François Pottier and Vincent Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1):117-158, January 2003. [ bib | PostScript | At publisher's | Abstract ]
[39] Christian Skalka and François Pottier. Syntactic type soundness for HM(X). In Proceedings of the Workshop on Types in Programming (TIP'02), volume 75 of Electronic Notes in Theoretical Computer Science, Dagstuhl, Germany, July 2002. [ bib | PostScript | Abstract ]
[40] François Pottier. A simple view of type-secure information flow in the π-calculus. In Proceedings of the 15th IEEE Computer Security Foundations Workshop, pages 320-330, Cape Breton, Nova Scotia, June 2002. [ bib | PostScript | Long PostScript | At publisher's | Abstract ]
[41] François Pottier and Vincent Simonet. Information flow inference for ML. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages (POPL'02), pages 319-330, Portland, Oregon, January 2002. Superseded by [38]. [ bib | PostScript | Long PostScript | At publisher's | Abstract ]
[42] François Pottier. Simplifying subtyping constraints: a theory. Information & Computation, 170(2):153-183, November 2001. [ bib | PostScript | At publisher's | Abstract ]
[43] Sylvain Conchon and François Pottier. JOIN(X): Constraint-based type inference for the join-calculus. In David Sands, editor, Proceedings of the 10th European Symposium on Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, pages 221-236. Springer, April 2001. [ bib | PostScript | Long PostScript | At publisher's | Abstract ]
[44] François Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. In David Sands, editor, Proceedings of the 10th European Symposium on Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, pages 30-45. Springer, April 2001. Superseded by [30]. [ bib | PostScript | At publisher's | Abstract ]
[45] François Pottier. A semi-syntactic soundness proof for HM(X). Research Report 4150, INRIA, March 2001. [ bib | PDF | Abstract ]
[46] François Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4):312-347, November 2000. [ bib | PostScript | Abstract ]
[47] François Pottier and Sylvain Conchon. Information flow inference for free. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 46-57, Montréal, Canada, September 2000. [ bib | PostScript | At publisher's | Abstract ]
[48] François Pottier. A 3-part type inference engine. In Gert Smolka, editor, Proceedings of the 2000 European Symposium on Programming (ESOP'00), volume 1782 of Lecture Notes in Computer Science, pages 320-335. Springer, March 2000. Superseded by [46]. [ bib | PostScript | At publisher's | Abstract ]
[49] François Pottier. Wallace: an efficient implementation of type inference with subtyping, February 2000. [ bib | Software ]
[50] François Pottier. A framework for type inference with subtyping. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 228-238, September 1998. [ bib | PostScript | At publisher's | Abstract ]
[51] François Pottier. Type inference in the presence of subtyping: from theory to practice. Research Report 3483, INRIA, September 1998. [ bib | PDF | Abstract ]
[52] François Pottier. Synthèse de types en présence de sous-typage: de la théorie à la pratique. PhD thesis, Université Paris 7, July 1998. [ bib | PostScript | Abstract ]
[53] François Pottier. Simplifying subtyping constraints. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP'96), pages 122-133, May 1996. [ bib | PostScript | At publisher's | Abstract ]
[54] François Pottier. Type inference and simplification for recursively constrained types. In Actes du GDR Programmation 1995 (journée du pôle Programmation Fonctionnelle), November 1995. [ bib | PostScript | Abstract ]
[55] François Pottier. Implémentation d'un système de modules évolué en Caml-Light. Research Report 2449, INRIA, January 1995. [ bib | PDF | PostScript | Abstract ]
[56] Michel Mauny and François Pottier. An implementation of Caml Light with existential types. Technical Report 2183, INRIA, October 1993. [ bib | PDF | PostScript | Abstract ]

This file was generated by bibtex2html 1.96.