Research
I work under the supervision of Alexandre Miquel and Hugo Herbelin. I am particularly interested by the mecanism of exceptions from a type theoretical point of view.
Thesis
My Ph.D thesis (in french) is available here.Papers
-
S. Lebresne, A System F with call-by-name exceptions. [extended version with proofs : PDF]
In 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, July 2008 -
S. Lebresne, Coding dependent elimination schemes using Σ-types. [PDF]
Unpublished. -
P. Berthomé, S. Lebresne, and K. Nguyen, Computation of Chromatic Polynomials Using Triangulations and Clique Trees.
In 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Metz, France, June 2005.
Talks
-
System F with exceptions. [PDF]
Talk given at INRIA, Rocquencourt, on March 17, 2008. I present an extension of System F with a mechanism of exceptions. -
System F with exceptions. [PDF]
Talk given at the workshop on Effects and Type Theory (EffTT) in Tallinn, Estonia. I present an extension of System F with a mechanism of exceptions. -
Un codage de l'élimination dépendante. [PDF]
Talk (in french) given at the LRI, Orsay, on November 4, 2005. I explain a coding of dependent elimination schemes for inductive data-types with non-dependent ones. -
Calcul du Polynôme Chromatique. [PDF]
Talk (in french) given at the séminaire thésard on June 22, 2005. I describe our algorithm for computing the chromatic polynomial of a graph.