Boris Yakobowski

An article entitled Le caractère ` à la rescousse - Factorisation et réutilisation de code grâce aux variants polymorphes ("The ` character to the rescue - Code factorization and reuse using polymorphic variants"), to be published at Journées Francophones des Langages Applicatifs 2008, is now online (only in french for the moment). It provides a hopefully gentle introduction to polymorphic variants, a feature of the typing system of OCaml.

Here is the source code of the examples: introduction, section 2, section 3 and section 4.

The abstract and the BibTeX entry can be found on my publications page.

A proof-of-concept prototype implementation of an ML^F typer, based on the results presented in our last paper, is now online.

Following our work on graphical types in ML^F, Didier Rémy and I have written a new paper presenting type inference and type soundness of ML^F entirely using graphs. The type inference is constraints-based and has a complexity similar to that of ML (ie. linear under reasonable assumptions).

Both a color and a black-and-white version are available. A long version with all the proofs will be available shortly.

The full abstract for the paper can be found in my publications page.

Didier Rémy and I have written a paper on a graph-based presentation of the types of the ML^F language. This paper has been presented at the TLDI'07 workshop. The submitted version of the paper (with a few typos corrected) is available, as well as a black and white version, and the slides I presented at the workshop.

A nearly definite version of the accompanying technical report is also available (and also in black and white). The last update was on 2007-01-19

The abstract of the paper, as well as BibTeX entries for both versions, can be found in my publications page.

This work is the continuation of what I presented at the APPSEM II Workshop, and entirely supersedes it.

I've presented at the 3rd APPSEM II Workshop a talk about some preliminary results of my thesis. More precisely, they consist in a reformulation of MLF using graphs for the representation of types. This is the corresponding extended abstract.

The slides I've used are here in pdf, or there for Advi users (the Advi version contains more transitions, but needs some manual recentering).

Note that all the content presented in the extended abstract is developped in this article.

The subject of my PhD Thesis is now online. It is entitled (in french) « Polymorphisme d'ordre omega avec inférence partielle mis en pratique »; I'm going to extend Didier Rémy and Didier Le Botlan's MLF.

I've defended today my Master Thesis, about certified compilation using an intermediate language in SSA form. The report and the slides I've presented are available, in pdf (in french only).

Using the resultas of an internship I did in the Ultra Group, Joe Wells and I have written a paper entitled « Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis », which was submitted to LOPSTR'04 (this is the version found in the preliminary proceedings of the conference).

I have presented the paper at LOPSTR'04 in Verona, Italy. The slides I used are here; you need advi to view them.

A final version of the paper is also available. Please note that the preliminary one is slightly more complete, as it includes an appendix not found in the final paper.

Finally, the abstract of the paper can be found in my publications page.