Using rewriting theory I study functional programming languages and their implementations. I'm also interested in logic and in concurrency theory. My advisor is Delia Kesner.
Rewriting
I'm working with Delia Kesner on various aspects of optimal reduction in the framework of weak reduction, and on the sharing of subterms. Some of my targets are: the lambda-calculus, higher-order rewriting, and pattern matching calculi. I also study how weak reduction gives to higher-order rewriting a "first-order" behavior.
Documents
- A paper on an axiomatic approach to the sharing of subterms in abstract rewriting (RTA, may 2012).
- A paper on full laziness and fully lazy lambda-lifting (POPL, january 2012). See also the slides from talks at CHoCoLa, LAC-GEOCAL, PoPL.
- A set of slides on optimal sharing for weak reduction in higher-order rewriting (Vrije Universiteit Amsterdam, January 2011).
- A set of slides and a paper on optimal sharing and weak reduction (PPDP, july 2010).
- A set of slides and a paper on explicit pattern matching and reduction strategies (HOR, july 2010).
Other work
Collaboration with Emmanuel Haucourt on the analysis of independence of processes in a concurrent program by geometrical means.