Travelled to:1 × Cyprus
1 × Germany
1 × Poland
1 × Sweden
2 × Canada
2 × Estonia
2 × Italy
2 × Japan
9 × USA
Collaborated with:∅ A.Charguéraud J.Jourdan N.Gauthier S.Conchon J.Protzenko N.Pouillard Y.Régis-Gianas V.Simonet T.Balabonski X.Leroy R.D.Cosmo D.Rémy C.Skalka S.F.Smith A.Guéneau G.Mével Paulo Emílio de Vilhena J.Schwinghammer H.Yang L.Birkedal B.Reus
Talks about:type (12) infer (8) program (3) subtyp (3) order (3) ml (3) constraint (2) translat (2) stratifi (2) function (2)
Person: François Pottier
DBLP: Pottier:Fran=ccedil=ois
Contributed to:
2014
20142013
2012
2011
201020102008
2008200720062005
200520042004200220012000200019981996
20162017201820192020Wrote 27 papers:
- FLOPS-2014-BalabonskiPP
- Type Soundness and Race Freedom for Mezzo (TB, FP, JP), pp. 253–269.
- ICFP-2014-Pottier #functional
- Hindley-milner elaboration in applicative style: functional pearl (FP), pp. 203–212.
- ICFP-2013-PottierP #programming
- Programming with permissions in Mezzo (FP, JP), pp. 173–184.
- ESOP-2012-JourdanPL #lr #parsing #validation
- Validating LR(1) Parsers (JHJ, FP, XL), pp. 397–416.
- POPL-2011-Pottier
- A typed store-passing translation for general references (FP), pp. 147–158.
- FoSSaCS-2010-SchwinghammerYBPR #semantics
- A Semantic Foundation for Hidden State (JS, HY, LB, FP, BR), pp. 2–17.
- ICFP-2010-PouillardP #fresh look #programming
- A fresh look at programming with names and binders (NP, FP), pp. 217–228.
- ICFP-2008-ChargueraudP #calculus #functional
- Functional translation of a calculus of capabilities (AC, FP), pp. 213–224.
- LICS-2008-Pottier #anti #higher-order
- Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule (FP), pp. 331–340.
- LICS-2007-Pottier
- Static Name Control for FreshML (FP), pp. 356–365.
- POPL-2006-PottierR #algebra #data type #type inference
- Stratified type inference for generalized algebraic data types (FP, YRG), pp. 232–244.
- ICFP-2005-Pottier #ml #type inference
- From ML type inference to stratified type inference (FP), p. 1.
- TLCA-2005-CosmoPR #commutative #recursion #type system
- Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.
- ICFP-2004-GauthierP #canonical #first-order #higher-order #matter #recursion
- Numbering matters: first-order canonical forms for second-order recursive types (NG, FP), pp. 150–161.
- POPL-2004-PottierG #polymorphism
- Polymorphic typed defunctionalization (FP, NG), pp. 89–98.
- POPL-2002-PottierS #data flow #ml
- Information flow inference for ML (FP, VS), pp. 319–330.
- ESOP-2001-ConchonP #calculus #constraints #type inference
- JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
- ESOP-2001-PottierSS #approach #data access
- A Systematic Approach to Static Access Control (FP, CS, SFS), pp. 30–45.
- ESOP-2000-Pottier #type inference
- A 3-Part Type Inference Engine (FP), pp. 320–335.
- ICFP-2000-PottierC #data flow #for free
- Information flow inference for free (FP, SC), pp. 46–57.
- ICFP-1998-Pottier #framework #type inference #type system
- A Framework for Type Inference with Subtyping (FP), pp. 228–238.
- ICFP-1996-Pottier #constraints #type system
- Simplifying Subtyping Constraints (FP), pp. 122–133.
- CC-2016-Pottier #fault #lr #parsing #reachability
- Reachability and error diagnosis in LR(1) parsers (FP), pp. 88–98.
- ESOP-2017-ChargueraudP #logic
- Temporary Read-Only Permissions for Separation Logic (AC, FP), pp. 260–286.
- ESOP-2018-GueneauCP #complexity #deduction #formal method #verification
- A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification (AG, AC, FP), pp. 533–560.
- ESOP-2019-MevelJP
- Time Credits and Time Receipts in Iris (GM, JHJ, FP), pp. 3–29.
- POPL-2020-VilhenaPJ #game studies #verification
- Spy game: verifying a local generic solver in Iris (PEdV, FP, JHJ), p. 28.