| [1] | Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. Submitted, November 2007. [ bib | PDF | PostScript | Abstract ] |
| [2] | 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 version (PDF) | Long version (PostScript) | Abstract ] |
| [3] | François Pottier and Yann Régis-Gianas. Extended static checking of call-by-value functional programs. Draft, July 2007. [ bib | PDF | PostScript | Abstract ] |
| [4] | 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 ] |
| [5] | 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 ] |
| [6] | 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 ] |
| [7] | 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 ] |
| [8] | 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 ] |
| [9] | François Pottier and Yann Régis-Gianas. Menhir, December 2005. [ bib | Software ] |
| [10] | 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 ] |
| [11] | François Pottier. Cαml, June 2005. [ bib | Software ] |
| [12] | 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 Verlag. [ bib | PDF | PostScript | Long version (PDF) | Long version (PostScript) | At publisher's | Abstract ] |
| [13] | 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 ] |
| [14] | 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 ] |
| [15] | 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 ] |
| [16] | François Pottier. Types et contraintes. Mémoire d'habilitation à diriger des recherches, Université Paris 7, December 2004. [ bib | PDF | PostScript ] |
| [17] | 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 ] |
| [18] | 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 [6]. [ bib | PDF | PostScript | At publisher's | Abstract ] |
| [19] | 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 ] |
| [20] | 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 version (PostScript) | At publisher's | Abstract ] |
| [21] | 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 ] |
| [22] | 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 ] |
| [23] | 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 version (PostScript) | At publisher's | Abstract ] |
| [24] | 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 [21]. [ bib | PostScript | Long version (PostScript) | At publisher's | Abstract ] |
| [25] | François Pottier. Simplifying subtyping constraints: a theory. Information & Computation, 170(2):153-183, November 2001. [ bib | PostScript | At publisher's | Abstract ] |
| [26] | 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 Verlag, April 2001. [ bib | PostScript | Long version (PostScript) | At publisher's | Abstract ] |
| [27] | 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 Verlag, April 2001. Superseded by [13]. [ bib | PostScript | At publisher's | Abstract ] |
| [28] | François Pottier. A semi-syntactic soundness proof for HM(X). Research Report 4150, INRIA, March 2001. [ bib | At publisher's | Abstract ] |
| [29] | François Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4):312-347, November 2000. [ bib | PostScript | Abstract ] |
| [30] | 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 ] |
| [31] | 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 Verlag, March 2000. Superseded by [29]. [ bib | PostScript | At publisher's | Abstract ] |
| [32] | François Pottier. Wallace: an efficient implementation of type inference with subtyping, February 2000. [ bib | Software ] |
| [33] | 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 ] |
| [34] | François Pottier. Type inference in the presence of subtyping: from theory to practice. Research Report 3483, INRIA, September 1998. [ bib | PostScript | At publisher's | Abstract ] |
| [35] | 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 ] |
| [36] | 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 ] |
| [37] | 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 ] |
| [38] | François Pottier. Implémentation d'un système de modules évolué en Caml-Light. Research Report 2449, INRIA, January 1995. [ bib | PostScript | At publisher's | Abstract ] |
| [39] | Michel Mauny and François Pottier. An implementation of Caml Light with existential types. Technical Report 2183, INRIA, October 1993. [ bib | PostScript | At publisher's | Abstract ] |
This file has been generated by bibtex2html 1.85.