Luca Saiu — (some) publications
I wrote the entries dated between 2007 and 2012 when
working at LIPN
(Laboratoire d'Informatique de l'Université Paris-Nord),
Université Paris 13,
and the 2014 entry when working at
Please also see my "talks" page.
- GNU epsilon, an extensible programming language
Compared to the "official" submitted test the version you find here
contains some minor rephrasings and grammar improvements, plus the
occasional correction — explicitly marked as such. However there
is no difference in the actual content: in particular the document
GNU epsilon software
frozen in its state as of August 2012: more or less all of the
"future developments" hinted at in the text, including multiple backends
with different data representations, pattern matching and native
compilation do exist and work now, among many other improvements devised
later. I may discuss some of the significant
improvements in my blog, and in the software
documentation when it's ready. The
epsilon mailing lists
are the best venue for discussion.
Luca Saiu, defended on 2012-11-19
Advisors: Christophe Fouqueré, Jean-Vincent Loddo;
Reviewers: Emmanuel Chailloux, Michel Mauny;
Other jury members: Roberto Di Cosmo (president), Manuel Serrano, Basile Starynkevitch, Peter Van Roy.
Reductionism is a viable strategy for designing and implementing practical
programming languages, leading to solutions which are easier to extend,
experiment with and formally analyze.
We formally specify and implement an extensible programming language, based on
a minimalistic first-order imperative core language plus strong
abstraction mechanisms, reflection and
self-modification features. The language can be extended to very high
levels: by using Lisp-style macros and code-to-code
transforms which automatically rewrite high-level expressions into
core forms, we define closures and first-class continuations on top of the core.
Non-self-modifying programs can be analyzed and formally reasoned upon, thanks
to the language simple semantics. We formally develop a static
analysis and prove a soundness property with respect to the
We develop a parallel garbage collector suitable to multi-core
machines to permit efficient execution of parallel programs.
(Some) peer-reviewed publications
About Vaucanson and automata:
About game theory:
Status Report: Marionnet — How to Implement a Virtual Network Laboratory in Six Months and Be Happy
Jean-Vincent Loddo, Luca Saiu, 2007
ACM SIGPLAN Workshop on ML, Freiburg (Germany), 2007
This is a reasonably detailed description of how Marionnet is implemented.
Marionnet: a virtual network laboratory and simulation tool
Jean-Vincent Loddo, Luca Saiu, 2008
SimulationWorks, Marseille (France), 2008
The first part is a simple user-oriented introduction to Marionnet.
Section 7 outlines a possible usage scenario for Marionnet, not related to teaching.
Paper (PDF, from Jean-Vincent's web site).
Drafts and Technical Reports
About garbage collection:
Scalable BIBOP garbage collection for parallel functional programs on multi-core machines
Luca Saiu, draft, 2011
An application of the BIBOP technique to the problem of improving memory locality in functional language implementations.
Last modified: 2016-08-27
Copyright © 2007, 2008, 2010, 2012, 2014, 2016 Luca Saiu
Verbatim copying and redistribution of this entire page are permitted provided this notice is preserved.