default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Pottier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]François Pottier:
Review of "Real World OCaml: Functional Programming for the Masses" Second Edition, by Yaron Minsky and Anil Madhavapeddy, 2023. J. Funct. Program. 34 (2024)- [j22]Denis Carnier
, François Pottier, Steven Keuchel:
Type Inference Logics. Proc. ACM Program. Lang. 8(OOPSLA2): 2125-2155 (2024) - [j21]François Pottier, Armaël Guéneau, Jacques-Henri Jourdan, Glen Mével:
Thunks and Debits in Separation Logic with Time Credits. Proc. ACM Program. Lang. 8(POPL): 1482-1508 (2024) - 2023
- [j20]Paulo Emílio de Vilhena, François Pottier:
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library. Log. Methods Comput. Sci. 19(4) (2023) - [j19]Alexandre Moine, Arthur Charguéraud, François Pottier:
A High-Level Separation Logic for Heap Space under Garbage Collection. Proc. ACM Program. Lang. 7(POPL): 718-747 (2023) - [c39]Paulo Emílio de Vilhena, François Pottier:
A Type System for Effect Handlers and Dynamic Labels. ESOP 2023: 225-252 - 2022
- [j18]Jean-Marie Madiot, François Pottier:
A separation logic for heap space under garbage collection. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c38]Alexandre Moine, Arthur Charguéraud, François Pottier:
Specification and verification of a transient stack. CPP 2022: 82-99 - 2021
- [j17]Paulo Emílio de Vilhena, François Pottier:
A separation logic for effect handlers. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c37]Frédéric Bour, François Pottier:
Faster reachability analysis for LR(1) parsers. SLE 2021: 113-125 - [i3]Paulo Emílio de Vilhena, François Pottier:
Verifying a Minimalist Reverse-Mode AD Library. CoRR abs/2112.07292 (2021) - 2020
- [j16]Glen Mével, Jacques-Henri Jourdan, François Pottier:
Cosmo: a concurrent separation logic for multicore OCaml. Proc. ACM Program. Lang. 4(ICFP): 96:1-96:29 (2020) - [j15]Paulo Emílio de Vilhena, François Pottier, Jacques-Henri Jourdan:
Spy game: verifying a local generic solver in Iris. Proc. ACM Program. Lang. 4(POPL): 33:1-33:28 (2020)
2010 – 2019
- 2019
- [j14]Arthur Charguéraud, François Pottier:
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits. J. Autom. Reason. 62(3): 331-365 (2019) - [c36]Glen Mével, Jacques-Henri Jourdan, François Pottier:
Time Credits and Time Receipts in Iris. ESOP 2019: 3-29 - [c35]Armaël Guéneau, Jacques-Henri Jourdan, Arthur Charguéraud, François Pottier:
Formal Proof and Analysis of an Incremental Cycle Detection Algorithm. ITP 2019: 18:1-18:20 - 2018
- [c34]Armaël Guéneau, Arthur Charguéraud, François Pottier:
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification. ESOP 2018: 533-560 - 2017
- [j13]François Pottier:
Visitors unchained. Proc. ACM Program. Lang. 1(ICFP): 28:1-28:28 (2017) - [j12]Jacques-Henri Jourdan, François Pottier:
A Simple, Possibly Correct LR Parser for C11. ACM Trans. Program. Lang. Syst. 39(4): 14:1-14:36 (2017) - [c33]François Pottier:
Verifying a hash table and its iterators in higher-order separation logic. CPP 2017: 3-16 - [c32]Arthur Charguéraud, François Pottier:
Temporary Read-Only Permissions for Separation Logic. ESOP 2017: 260-286 - 2016
- [j11]Thibaut Balabonski, François Pottier, Jonathan Protzenko:
The Design and Formalization of Mezzo, a Permission-Based Programming Language. ACM Trans. Program. Lang. Syst. 38(4): 14:1-14:94 (2016) - [c31]François Pottier:
Reachability and error diagnosis in LR(1) parsers. CC 2016: 88-98 - 2015
- [c30]Arthur Charguéraud, François Pottier:
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation. ITP 2015: 137-153 - [c29]François Pottier, Jonathan Protzenko:
A Few Lessons from the Mezzo Project. SNAPL 2015: 221-237 - 2014
- [c28]Thibaut Balabonski, François Pottier, Jonathan Protzenko:
Type Soundness and Race Freedom for Mezzo. FLOPS 2014: 253-269 - [c27]François Pottier:
Hindley-milner elaboration in applicative style: functional pearl. ICFP 2014: 203-212 - 2013
- [j10]François Pottier:
Syntactic soundness proof of a type-and-capability system with hidden state. J. Funct. Program. 23(1): 38-144 (2013) - [j9]Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, Hongseok Yang:
A step-indexed Kripke model of hidden state. Math. Struct. Comput. Sci. 23(1): 1-54 (2013) - [c26]François Pottier, Jonathan Protzenko:
Programming with permissions in Mezzo. ICFP 2013: 173-184 - [i2]Jonathan Protzenko, François Pottier:
Programming with Permissions in Mezzo. CoRR abs/1311.7242 (2013) - [i1]Armaël Guéneau, François Pottier, Jonathan Protzenko:
The ins and outs of iteration in Mezzo. CoRR abs/1311.7256 (2013) - 2012
- [j8]Nicolas Pouillard, François Pottier:
A unified treatment of syntax with binders. J. Funct. Program. 22(4-5): 614-704 (2012) - [c25]Jacques-Henri Jourdan, François Pottier, Xavier Leroy:
Validating LR(1) Parsers. ESOP 2012: 397-416 - 2011
- [c24]François Pottier:
A typed store-passing translation for general references. POPL 2011: 147-158 - [c23]Alexandre Pilkiewicz, François Pottier:
The essence of monotonic state. TLDI 2011: 73-86 - 2010
- [c22]Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus:
A Semantic Foundation for Hidden State. FoSSaCS 2010: 2-17 - [c21]Nicolas Pouillard, François Pottier:
A fresh look at programming with names and binders. ICFP 2010: 217-228
2000 – 2009
- 2008
- [c20]Arthur Charguéraud, François Pottier:
Functional translation of a calculus of capabilities. ICFP 2008: 213-224 - [c19]François Pottier:
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule. LICS 2008: 331-340 - [c18]Yann Régis-Gianas, François Pottier:
A Hoare Logic for Call-by-Value Functional Programs. MPC 2008: 305-335 - 2007
- [j7]Vincent Simonet, François Pottier:
A constraint-based approach to guarded algebraic data types. ACM Trans. Program. Lang. Syst. 29(1): 1 (2007) - [c17]François Pottier:
Static Name Control for FreshML. LICS 2007: 356-365 - [e2]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, ISBN 1-59593-393-X [contents] - 2006
- [j6]François Pottier, Nadji Gauthier:
Polymorphic typed defunctionalization and concretization. High. Order Symb. Comput. 19(1): 125-162 (2006) - [c16]François Pottier, Yann Régis-Gianas:
Stratified type inference for generalized algebraic data types. POPL 2006: 232-244 - [e1]Andrew Kennedy, François Pottier:
Proceedings of the ACM Workshop on ML, 2006, Portland, Oregon, USA, September 16, 2006. ACM 2006, ISBN 1-59593-483-9 [contents] - 2005
- [j5]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) - [c15]François Pottier:
From ML type inference to stratified type inference. ICFP 2005: 1 - [c14]Roberto Di Cosmo, François Pottier, Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products. TLCA 2005: 179-193 - [c13]François Pottier:
An Overview of Calphaml. ML 2005: 27-52 - [c12]François Pottier, Yann Régis-Gianas:
Towards Efficient, Typed LR Parsers. ML 2005: 155-180 - 2004
- [c11]Nadji Gauthier, François Pottier:
Numbering matters: first-order canonical forms for second-order recursive types. ICFP 2004: 150-161 - [c10]François Pottier, Nadji Gauthier:
Polymorphic typed defunctionalization. POPL 2004: 89-98 - 2003
- [j4]Jean-Christophe Filliâtre, François Pottier:
Producing all ideals of a forest, functionally. J. Funct. Program. 13(5): 945-956 (2003) - [j3]François Pottier, Vincent Simonet:
Information flow inference for ML. ACM Trans. Program. Lang. Syst. 25(1): 117-158 (2003) - 2002
- [c9]François Pottier:
A Simple View of Type-Secure Information Flow in the p-Calculus. CSFW 2002: 320-330 - [c8]François Pottier, Vincent Simonet:
Information flow inference for ML. POPL 2002: 319-330 - [c7]Christian Skalka, François Pottier:
Syntactic Type Soundness for HM(X). TIP@MPC 2002: 61-74 - 2001
- [j2]François Pottier:
Simplifying Subtyping Constraints: A Theory. Inf. Comput. 170(2): 153-183 (2001) - [c6]François Pottier, Christian Skalka, Scott F. Smith:
A Systematic Approach to Static Access Control. ESOP 2001: 30-45 - [c5]Sylvain Conchon, François Pottier:
JOIN(X): Constraint-Based Type Inference for the Join-Calculus. ESOP 2001: 221-236 - 2000
- [j1]François Pottier:
A Versatile Constraint-Based Type Inference System. Nord. J. Comput. 7(4): 312-347 (2000) - [c4]François Pottier:
A 3-Part Type Inference Engine. ESOP 2000: 320-335 - [c3]François Pottier, Sylvain Conchon:
Information flow inference for free. ICFP 2000: 46-57
1990 – 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
