• Publications
  • Influence
Information flow inference for ML
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions and let-polymorphism, which we refer to as ML. The type system is
Simplifying subtyping constraints
TLDR
A powerful notion of entailment between constraint sets is proposed, as well as an algorithm to check it, which is proved to be sound, and two new typing rules which allow simplifying constraint sets are introduced.
Stratified type inference for generalized algebraic data types
TLDR
Stratified type inference for generalized algebraic data types is presented, which states that theorems related to type inference of discrete-time data types are well-known and straightforward to implement.
Static Name Control for FreshML
  • F. Pottier
  • Computer Science
    22nd Annual IEEE Symposium on Logic in Computer…
  • 10 July 2007
TLDR
This paper defines Pure FreshML, a subset of FreshML equipped with a static proof system that guarantees purity, and argues that pure FreshML can express non-trivial syntax-manipulating algorithms.
Information flow inference for free
This paper shows how to systematically extend an arbitrary type system with dependency information, and how soundness and non-interference proofs for the new system may rely upon, rather than
A simple view of type-secure information flow in the /spl pi/-calculus
  • F. Pottier
  • Computer Science
    Proceedings 15th IEEE Computer Security…
  • 24 June 2002
TLDR
This paper aims to provide an elementary noninterference proof in the setting of the /spl pi/-calculus by reducing the problem to subject reduction - a safety property - for a nonstandard, but fairly natural, extension of the -calculus.
Simplifying Subtyping Constraints: A Theory
  • F. Pottier
  • Computer Science
    Inf. Comput.
  • 11 November 2001
TLDR
Overall, this paper gives a concise theoretical account of the techniques found at the core of the type inference system, and highlights a small number of general ideas, which explain the algorithms at a high level and may be applicable to a variety of other systems.
A Versatile Constraint-Based Type Inference System
  • F. Pottier
  • Computer Science
    Nord. J. Comput.
  • 1 December 2000
The combination of subtyping, conditional constraints and rows yields a powerful constraint-based type inference system. We illustrate this claim by proposing solutions to three delicate type
The essence of monotonic state
We extend a static type-and-capability system with new mechanisms for expressing the promise that a certain abstract value evolves monotonically with time; for enforcing this promise; and for taking
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
TLDR
This work implements Union-Find as an OCaml library and formally endow it with a modular specification that offers a full functional correctness guarantee as well as an amortized complexity bound.
...
1
2
3
4
5
...