#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1996

2017

- This year (7)
- Last 5 years (26)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- François Pottier, Vincent Simonet
- ACM Trans. Program. Lang. Syst.
- 2002

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 Core ML. The type system is constraint-based and has decidable type inference. Its non-interference proof is reasonably lightweight, thanks to the use of a number of orthogonal… (More)

- François Pottier, Christian Skalka, Scott F. Smith
- ESOP
- 2001

The Java Security Architecture includes a dynamic mechanism for enforcing access control checks, the so-called <i>stack inspection</i> process. While the architecture has several appealing features, access control checks are all implemented via dynamic method calls. This is a highly nondeclarative form of specification that is hard to read, and that leads… (More)

- François Pottier
- ICFP
- 1996

This paper studies type inference for a functional, ML-style language with subtyping, and focuses on the issue of simplifying inferred constraint sets. We propose a powerful notion of entailment between constraint sets, as well as an algorithm to check it, which we prove to be sound. The algorithm, although very powerful in practice, is not complete. We… (More)

- François Pottier
- Inf. Comput.
- 2001

- François Pottier
- Nord. J. Comput.
- 2000

- François Pottier, Sylvain Conchon
- ICFP
- 2000

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 duplicate, the soundness proof of the original system. This allows enriching virtually any of the type systems known today with information flow analysis, while… (More)

- François Pottier, Yann Régis-Gianas
- POPL
- 2006

Stratified type inference for generalized algebraic data types.

- Arthur Charguéraud, François Pottier
- ICFP
- 2008

Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabilities, and singleton types. It is designed for a high-level calculus with higher-order functions, algebraic data structures, and references (mutable memory cells). The type system… (More)

- François Pottier
- 2005

Cαml is a tool that turns a so-called “binding specification” into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. Cαml is meant to help writers of interpreters, compilers, or other programs-that-manipulate-programs deal with α-conversion in a… (More)

- Vincent Simonet, François Pottier
- ACM Trans. Program. Lang. Syst.
- 2007

We study HMG(<i>X</i>), an extension of the constraint-based type system HM(<i>X</i>) with deep pattern matching, polymorphic recursion, and <i>guarded algebraic data types</i>. Guarded algebraic data types subsume the concepts known in the literature as <i>indexed types</i>, <i>guarded recursive datatype constructors</i>, <i>(first-class) phantom… (More)