I a postdoctoral researcher at LIPN (LCR team) since October 1st. See "Postdoc ALAL" below for details.
PhD: I have defended my Ph.D. thesis entitled Du typage vectoriel, on September 23th, 2011 at the Université de Grenoble. I prepared it within the CAPP team at the Laboratoire d'Informatique de Grenoble and under the supervision of Pablo Arrighi and Frédéric Prost. Here you can download the manuscript and the slides that I used for the defense: Thesis | Slides | Video
Undergraduate: Before going to Grenoble, I obtained the "Licenciatura" degree in Computer Science (December 21th, 2007) at Universidad Nacional de Rosario, Argentina. It is a five-year degree with thesis, equivalent to a "Master recherche" degree in the French system.
Membership: I am part of the GdR Informatique Mathematique and its working group GEOCAL (Géométrie du calcul). I also participate in the PEPS project QuAND (Aspects quantitatifs du non-déterminisme).
Students: Pablo Buiras finished his master's thesis (argentinian "Licenciatura") at Universidad Nacional de Rosario supervised by Mauro Jaskelioff and me.
ALAL is a 12-month research project in theoretical computer science, started in October 2011 and jointly developed at the Laboratoire d'Informatique de Paris Nord (Université Paris 13) and the INRIA Paris-Rocquencourt coordinated by Michele Pagani (Paris 13) and Gilles Dowek (INRIA).
Financial support is provided by the Région Île-de-France, via the Digiteo consortium.
The project focuses on formal foundations for language-based (especially static) techniques guaranteeing resource-related runtime properties of programs. The project belongs to the research area whose aim is to associate to a program a certification assuring some specific properties. We will derive the tools and techniques for our investigation from the field of logical proof-theory and semantics, with special interest in linear logic and λ-calculus. In particular, we will explore the new interactions between linear algebra and the formal methods approach to computation, recently arisen from the differential extension of linear logic and the algebraic λ-calculi. The expected result is a robust theoretical framework in which to develop static analysis and verification tools for non-deterministic paradigms, such as stochastic systems, concurrent computation, quantum programming, etc.