François Pottier

According to our database1, François Pottier authored at least 52 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A separation logic for effect handlers.
Proc. ACM Program. Lang., 2021

2020
Spy game: verifying a local generic solver in Iris.
Proc. ACM Program. Lang., 2020

Cosmo: a concurrent separation logic for multicore OCaml.
Proc. ACM Program. Lang., 2020

2019
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits.
J. Autom. Reason., 2019

Formal Proof and Analysis of an Incremental Cycle Detection Algorithm.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

Time Credits and Time Receipts in Iris.
Proceedings of the Programming Languages and Systems, 2019

2018
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification.
Proceedings of the Programming Languages and Systems, 2018

2017
A Simple, Possibly Correct LR Parser for C11.
ACM Trans. Program. Lang. Syst., 2017

Visitors unchained.
Proc. ACM Program. Lang., 2017

Temporary Read-Only Permissions for Separation Logic.
Proceedings of the Programming Languages and Systems, 2017

Verifying a hash table and its iterators in higher-order separation logic.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
The Design and Formalization of Mezzo, a Permission-Based Programming Language.
ACM Trans. Program. Lang. Syst., 2016

Reachability and error diagnosis in LR(1) parsers.
Proceedings of the 25th International Conference on Compiler Construction, 2016

2015
A Few Lessons from the Mezzo Project.
Proceedings of the 1st Summit on Advances in Programming Languages, 2015

Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

2014
Hindley-milner elaboration in applicative style: functional pearl.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Type Soundness and Race Freedom for Mezzo.
Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

2013
A step-indexed Kripke model of hidden state.
Math. Struct. Comput. Sci., 2013

Syntactic soundness proof of a type-and-capability system with hidden state.
J. Funct. Program., 2013

The ins and outs of iteration in Mezzo.
CoRR, 2013

Programming with permissions in Mezzo.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
A unified treatment of syntax with binders.
J. Funct. Program., 2012

Validating LR(1) Parsers.
Proceedings of the Programming Languages and Systems, 2012

2011
The essence of monotonic state.
Proceedings of TLDI 2011: 2011 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2011

A typed store-passing translation for general references.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

2010
A fresh look at programming with names and binders.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

A Semantic Foundation for Hidden State.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2008
A Hoare Logic for Call-by-Value Functional Programs.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Functional translation of a calculus of capabilities.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
A constraint-based approach to guarded algebraic data types.
ACM Trans. Program. Lang. Syst., 2007

Static Name Control for FreshML.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Polymorphic typed defunctionalization and concretization.
High. Order Symb. Comput., 2006

Towards Efficient, Typed LR Parsers.
Electron. Notes Theor. Comput. Sci., 2006

An Overview of C<i>alpha</i>ml.
Electron. Notes Theor. Comput. Sci., 2006

Stratified type inference for generalized algebraic data types.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

2005
A systematic approach to static access control.
ACM Trans. Program. Lang. Syst., 2005

Subtyping Recursive Types Modulo Associative Commutative Products.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

From ML type inference to stratified type inference.
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

2004
Polymorphic typed defunctionalization.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Numbering matters: first-order canonical forms for second-order recursive types.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003
Information flow inference for ML.
ACM Trans. Program. Lang. Syst., 2003

Producing all ideals of a forest, functionally.
J. Funct. Program., 2003

2002
Syntactic Type Soundness for HM(X).
Electron. Notes Theor. Comput. Sci., 2002

A Simple View of Type-Secure Information Flow in the p-Calculus.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

2001
Simplifying Subtyping Constraints: A Theory.
Inf. Comput., 2001

JOIN(X): Constraint-Based Type Inference for the Join-Calculus.
Proceedings of the Programming Languages and Systems, 2001

2000
A Versatile Constraint-Based Type Inference System.
Nord. J. Comput., 2000

Information flow inference for free.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

A 3-Part Type Inference Engine.
Proceedings of the Programming Languages and Systems, 2000

1998
A Framework for Type Inference with Subtyping.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1996
Simplifying Subtyping Constraints.
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996


  Loading...