| 2008 |
|---|
| 29 | EE | Arthur Charguéraud,
François Pottier:
Functional translation of a calculus of capabilities.
ICFP 2008: 213-224 |
| 28 | EE | François Pottier:
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule.
LICS 2008: 331-340 |
| 27 | EE | Yann Régis-Gianas,
François Pottier:
A Hoare Logic for Call-by-Value Functional Programs.
MPC 2008: 305-335 |
| 2007 |
|---|
| 26 | | François Pottier,
George C. Necula:
Proceedings of TLDI'07: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Nice, France, January 16, 2007
ACM 2007 |
| 25 | EE | François Pottier:
Static Name Control for FreshML.
LICS 2007: 356-365 |
| 24 | EE | Vincent Simonet,
François Pottier:
A constraint-based approach to guarded algebraic data types.
ACM Trans. Program. Lang. Syst. 29(1): (2007) |
| 2006 |
|---|
| 23 | | Andrew Kennedy,
François Pottier:
Proceedings of the ACM Workshop on ML, 2006, Portland, Oregon, USA, September 16, 2006
ACM 2006 |
| 22 | EE | François Pottier,
Yann Régis-Gianas:
Stratified type inference for generalized algebraic data types.
POPL 2006: 232-244 |
| 21 | EE | François Pottier,
Yann Régis-Gianas:
Towards Efficient, Typed LR Parsers.
Electr. Notes Theor. Comput. Sci. 148(2): 155-180 (2006) |
| 20 | EE | François Pottier:
An Overview of Calphaml.
Electr. Notes Theor. Comput. Sci. 148(2): 27-52 (2006) |
| 19 | EE | François Pottier,
Nadji Gauthier:
Polymorphic typed defunctionalization and concretization.
Higher-Order and Symbolic Computation 19(1): 125-162 (2006) |
| 2005 |
|---|
| 18 | EE | François Pottier:
From ML type inference to stratified type inference.
ICFP 2005: 1 |
| 17 | EE | Roberto Di Cosmo,
François Pottier,
Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products.
TLCA 2005: 179-193 |
| 16 | EE | François Pottier,
Christian Skalka,
Scott F. Smith:
A systematic approach to static access control.
ACM Trans. Program. Lang. Syst. 27(2): 344-382 (2005) |
| 2004 |
|---|
| 15 | EE | Nadji Gauthier,
François Pottier:
Numbering matters: first-order canonical forms for second-order recursive types.
ICFP 2004: 150-161 |
| 14 | EE | François Pottier,
Nadji Gauthier:
Polymorphic typed defunctionalization.
POPL 2004: 89-98 |
| 2003 |
|---|
| 13 | EE | François Pottier,
Vincent Simonet:
Information flow inference for ML.
ACM Trans. Program. Lang. Syst. 25(1): 117-158 (2003) |
| 12 | EE | Jean-Christophe Filliâtre,
François Pottier:
Producing all ideals of a forest, functionally.
J. Funct. Program. 13(5): 945-956 (2003) |
| 2002 |
|---|
| 11 | EE | François Pottier:
A Simple View of Type-Secure Information Flow in the p-Calculus.
CSFW 2002: 320-330 |
| 10 | EE | François Pottier,
Vincent Simonet:
Information flow inference for ML.
POPL 2002: 319-330 |
| 9 | EE | Christian Skalka,
François Pottier:
Syntactic Type Soundness for HM(X).
Electr. Notes Theor. Comput. Sci. 75: (2002) |
| 2001 |
|---|
| 8 | EE | Sylvain Conchon,
François Pottier:
JOIN(X): Constraint-Based Type Inference for the Join-Calculus.
ESOP 2001: 221-236 |
| 7 | EE | François Pottier,
Christian Skalka,
Scott F. Smith:
A Systematic Approach to Static Access Control.
ESOP 2001: 30-45 |
| 6 | EE | François Pottier:
Simplifying Subtyping Constraints: A Theory.
Inf. Comput. 170(2): 153-183 (2001) |
| 2000 |
|---|
| 5 | EE | François Pottier:
A 3-Part Type Inference Engine.
ESOP 2000: 320-335 |
| 4 | EE | François Pottier,
Sylvain Conchon:
Information flow inference for free.
ICFP 2000: 46-57 |
| 3 | | François Pottier:
A Versatile Constraint-Based Type Inference System.
Nord. J. Comput. 7(4): 312-347 (2000) |
| 1998 |
|---|
| 2 | EE | François Pottier:
A Framework for Type Inference with Subtyping.
ICFP 1998: 228-238 |
| 1996 |
|---|
| 1 | | François Pottier:
Simplifying Subtyping Constraints.
ICFP 1996: 122-133 |
