World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
3723
World Ranking
13720
National Ranking
368

Best Publications

  • Information flow inference for ML

    François Pottier;Vincent Simonet

  • Information flow inference for ML

    François Pottier;Vincent Simonet

  • Simplifying Subtyping Constraints

    François Pottier

  • Information flow inference for free

    François Pottier;Sylvain Conchon

  • A systematic approach to static access control

    François Pottier;Christian Skalka;Scott Smith

  • Simplifying subtyping constraints

    François Pottier

  • Validating LR (1) parsers

    Jacques-Henri Jourdan;François Pottier;Xavier Leroy

  • A simple view of type-secure information flow in the /spl pi/-calculus

    F. Pottier

  • A framework for type inference with subtyping

    François Pottier

  • Stratified type inference for generalized algebraic data types

    François Pottier;Yann Régis-Gianas

  • A constraint-based approach to guarded algebraic data types

    Vincent Simonet;François Pottier

  • A Systematic Approach to Static Access Control

    François Pottier;Christian Skalka;Scott F. Smith

  • An Overview of Cαml

    François Pottier

  • Functional translation of a calculus of capabilities

    Arthur Charguéraud;François Pottier

  • Type Inference in the Presence of Subtyping: from Theory to Practice

    François Pottier

  • A versatile constraint-based type inference system

    François Pottier

  • Static Name Control for FreshML

    F. Pottier

  • A Hoare Logic for Call-by-Value Functional Programs

    Yann Régis-Gianas;François Pottier

  • Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule

    F. Pottier

  • Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

    Arthur Charguéraud;François Pottier

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: