Domenico Ruoppolo – CV - LIPN

Domenico Ruoppolo
CV
Personal Information
First Name
Last Name
Date of Birth
Place of Birth
Nationality
Domenico.
Ruoppolo.
December 16th, 1985.
Naples, Italy.
Italian.
Contacts
Professional Contacts
Location Laboratoire d’Informatique de Paris Nord, Institut Galilée, Université Paris 13.
Address
Office
Office Phone
Mail
Web Page
99 avenue Jean-Baptiste Clément, 93430 Villetaneuse, France.
B311.
+33 01 49 40 36 60.
[email protected].
https://lipn.univ-paris13.fr/∼ruoppolo.
Personal Contacts
Address
Home Phone
Mob. Phone
Mail
25 avenue Parmentier, 75011 Paris, France.
+33 01 84 06 92 67.
+33 06 56 73 49 44.
[email protected].
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
1/9
Languages
Italian Mothertongue
French Advanced
English Intermediate
Perfectly fluent
Conversationally fluent
Current Position
Research Appointment
Qualification
Starting
Ending
Supervisors
Department
Ph.D Candidate in Computer Science.
October 1st, 2012.
autumn 2016.
Stefano Guerrini, Giulio Manzonetto.
Laboratoire d’Informatique de Paris Nord (LIPN).
Research Logique, Calcul et Raisonnement (LCR).
Group
Institution École Doctorale Galilée, Institut Galilée.
University Université Paris 13, Sorbonne Paris Cité.
Teaching Appointment
Qualification
Starting
Ending
Department
Institution
University
Interim Teacher (A.T.E.R.) in Computer Science.
September 1st, 2015.
June 30th, 2016.
Département Gestion des Entreprises et des Administrations.
Institut Universitaire de Technologie (IUT) de Villetaneuse.
Université Paris 13, Sorbonne Paris Cité.
Previous Appointments
Previous Teaching Appointment
Qualification Temporary Teacher in Computer Science.
Starting October 1st, 2012.
Ending August 31th, 2015.
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
2/9
Department Département Informatique.
Institution Institut Universitaire de Technologie (IUT) de Villetaneuse.
University Université Paris 13, Sorbonne Paris Cité.
Education
(Most Recent) Master Degree
Degree MScRes in Computer Science.
Name Master Parisien de Recherche en Informatique (MPRI).
formally Master 2 Mathématiques specialité Informatique Recherche
Partnership Université Paris 7, École Normale Supérieure de Paris, École NorUniversities male Supérieure de Cachan *, École Polythécnique Paris-Saclay.
* Enrolling Institution
Period Academic Year 2011-2012.
Syllabus Categories and λ-Calculi • Linear Logic and Logical Paradigms of Computation •
Models of Programming Languages: Domains, Categories, Games • Foundations
of Proof Systems and Proof Assistants • Mathematical Foundations of Automata Theory • Set Theory and Large Cardinals • Logical and Computational
Structures for Linguistic Modelling.
Internship Report Title (in French): Sémantique Relationnelle du λµ-Calculus,
Internship at LIPN, Université Paris 13.
Supervisors: Stefano Guerrini and Giulio Manzonetto
(Other) Master Degree
Degree
Name
University
Period
MSc in Mathematics.
Laurea Magistrale in Matematica.
Università degli Studi di Napoli "Federico II".
Academic Years 2008-2009 and 2009-2010.
Syllabus Foundations of Algebraic Structures • Foundations of Higher Mathematical
Analysis • Elements of Algebraic and Geometric Topology • Algebraic Methods
for Cryptography • Mathematical Methods in Biology • Elementary Mathematics
From an Higher point of View • Set Theory • Mathematical Logic • Logic and
Logic Programming • Elements of Theoretical Computer Science • Computability
and Complexity.
Master Title (in Italian): Dalla Logica di Base al Calcolo UB.
Thesis Supervisors: Claudia Faggian, Giovanni Sambin and Virginia Vaccaro
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
3/9
Bachelor Degree
Degree
Name
University
Period
BSc in Mathematics.
Laurea in Matematica.
Università degli Studi di Napoli "Federico II".
from Academic Year 2004-2005 to Academic Year 2007-2008.
Syllabus Algebra I • Calculus I • Geometry I • Introduction to Programming • Physics I
• Algebra II • Calculus II • Geometry II • Introduction to Numerical Methods in
Programming • Physics II • Introduction to Mathematical Physics • Dynamical
Systems • Probability and Statistics • Elements of Mathematical Economics •
Elements of Algebraic Geometry • Elementary Mathematics • Mathematical
Education • Foundations of Mathematics.
Bachelor Title (in Italian): Assioma di Anti-Fondazione per la Teoria degli
Thesis Insiemi Zermelo-Fraenkel *.
Supervisor: Roberto Tortora
Awarded for the Best Italian Bachelor Theses in Logic 2009 by the Italian Association
for Logic and its Applications (AILA).
Research
General scientific context
My research fits within the abstract and logic-oriented approaches to computation. In particular,
it relies upon the proofs-as-programs correspondence, also called Curry-Howard isomorphism.
Such correspondence is the realization that the many variants of Church’s λ-calculus overlap
with a great variety of deductive systems issued from proof theory, the branch of mathematical
logic giving a prominent role to the dynamics of rewriting of proofs.
More specifically, my work concerns denotational semantics of programs seen as terms of
λ-calculi, i.e., the wide range of formal methods that developed from the idea of Scott and
Strachey to interpret data types as mathematical structures more or less sophisticated from an
algebraic and topological point of view, and programs as functions preserving these structures.
Usually the kind of models that I study, no matter if concerning some general categorical setting
or in a more specific category, have their source of inspiration and their technical roots in the
semantics of Linear Logic.
Relational graph models and Morris’s observational equivalence
My main line of research - and the topic of my PhD thesis - is an ongoing work with my
co-advisor Giulio Manzonetto.
The work deals with the traditional untyped λ-calculus, that is the system given by terms
Λ : M, N ::= x | λx.M | M N
(where x ∈ Var, countable set of variables)
and the rewriting rule (λx.M )N →β M {N/x}. This system is the common core of all functional
programming languages, and it is enough to represent all Turing-computable functions.
We attacked a classical problem in the theory of programming: when are two programs
equivalent? In the case of programs formalized as λ-terms, it has become standard to regard
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
4/9
two programs M and N as equivalent when they are contextually equivalent with respect to
some fixed set O ⊆ Λ of observables λ-terms. This means that one can plug either M or N into
any environment of execution C[−], i.e. any λ-term with a hole, without noticing any difference
from the point of view of O. Our work focuses on Morris’s equivalence: the one obtained when
O is the set of β-normal forms.
A limitation of the traditional studying of observational equivalences is to abstract away from
the execution process and overlook quantitative aspects such as the time, space, or energy
consumed by a computation. Our work fits in a wider research program whose aim is to
overcome these limitations. We focus on the simplest of the aforementioned quantitative
aspects: the number of times a program M calls its sub-programs (which are its resources from
a functional perspective) during its execution.
In most denotational semantics (cpo’s, Scott domains, stable and strongly stable semantics,
coherence and hypercoherence spaces, etc.) the interpretation of datatypes relies on some
order, that represents the increase of knowledge in the information carried by the datatype.
As concerns programs, they are interpreted as functions that are continuous with respect to
an appropriate topology built upon such order. On the contrary, the kind of denotational
semantics we use, called relational semantics, interprets types as generic unstructured sets, and
programs of type A1 × . . . × An → B as relations between finite multisets of elements of the
sets [[Ai ]] interpreting the types Ai in input, and the set [[B]] interpreting the type of the output.
This explicitly accommodates in the models the ideas of linear control of resources. We defined
the class of relational graph models (rgm’s for short) for the untyped λ-calculus. Namely, a
rgm D = (D, i) is given by an infinite set D and a total injection i : Mf (D) × D → D. Here
Mf (X) stands for the set of all finite multisets whose elements are in the set X. In practice,
we handle rgm’s with a type-theoretical approch. Indeed, we formalize the inhabitance of the
interpretation of λ-terms in any rgm by means of a corresponding non-idempotent intersection
type system.
My main result is contained in a paper to appear in the proceedings of the conference FSCD16,
and co-authored with F. Breuvart, G. Manzonetto and A. Polonsky. It is a characterization of all
rgm’s fully abstract for the so-called Morris’s observational pre-order ≤, a refinement of Morris’s
equivalence defined by: M ≤ N iff for all C[−] whenever C[M ] has a β-normal form then C[N ]
does. A rgm is fully abstract in such sense iff it is extensional and λ-König. Intuitively, a model
is λ-König when every λ-definable tree has an infinite path which is witnessed by some element
of the model. A result of characterization of all models in a given semantics (rgm’s in this case)
being fully abstract w.r.t. a certain notion of observability is a very rare result (one more only
appeared in literature in 2014).
In a previous paper we also introduced a notion of extensional Taylor expansion T η (M ) of any
λ-term M , a context-sensitive generalization of the influent notion of Taylor expansion. This is
yet another characterization of Morris’s equivalence.
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
5/9
Publications
In Proceedings of International Peer-Reviewed Conferences
2016 New Results on Morris’s Observational Theory: the Beneficts of Separating the Inseparable, To appear in Proc. of FSCD 2016.
Co-authors: Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky
2016 The Minimal Preorder and Lambda-Theory for Relational Graph
Models of the Untyped Lambda Calculus, submitted.
2014 Relational Graph Models, Taylor Expansion and Extensionality,
Electr. Notes Theor. Comput. Sci. 308: 245-272, Proc. of MFPS XXX.
Co-author: Giulio Manzonetto
Meetings
International Conferences
2014 30th International Conference on Mathematical Foundations of Programming Semantics (MFPS XXX), Cornell University, Ithaca, New York,
USA, June 12-15, 2014.
Attending as speaker & co-author of an accepted paper
International Workshops
2014 Domains XI, 11th International Workshop on Domain Theory and
Applications, Université Paris Diderot, Paris, France, September 8-10, 2014.
Attending as co-author of an accepted contribution
Other Meetings
2014 Semantics of Proofs and Certified Mathematics, Institut Henry Poincaré,
Paris, France, Avril-July, 2014.
2013 A scientific meeting in honor of Antonino Salibra, Laboratory PPS,
Université Paris Diderot, Paris, France, June 1-2, 2013.
2013 Annual Meeting of the Working Group GeoCal (Géométrie du Calcul)
of the CNRS National Research Group Informatique Mathématique,
École Normale Supérieure de Lyon, Lyon, France, February 15, 2013.
2013 French ANR Project COQUAS (COmputing with QUAntitative Semantics) Kick-Off Meeting, Institut Henry Poincaré, Paris, France, February
7-8, 2013.
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
6/9
Reviews
Conferences CSL13 (sub reviewer), MFPS15 (sub reviewer).
Schools
International Schools
2013 Oregon Programming Languages Summer School 2013: Types, Logic,
and Verification, University of Oregon, Eugene, Oregon, USA, July 22 - August
3, 2013.
Level: Graduate
National Schools
2009 Italian Summer School on Logic 2009, University of Milan, Gagnano, BR,
Italy, August 23-29, 2009 .
Level: Undergraduate
Awards and Scholarships
2012 French Government Three-Year Ph.D Scholarship.
Received from the Ministère de l’Éducation Nationale, de l’Enseignement Supérieur de
la Recherche
2011 One-Year Graduate Scholarship for the MPRI Master Programme.
Received from INRIA (Institut National de Recherche en Informatique et en Automatique) and the École Normale Supérieure de Cachan
2009 Award for the Best Italian Bachelor Theses in Logic 2009.
Received from the Italian Association for Logic and its Applications (AILA)
Teaching Activities (in French)
Qualification A.T.E.R..
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
7/9
Composante Département G.E.A., Institut Universitaire de Technologie de Villetaneuse,
Université Paris 13.
Filière Diplôme Universitaire de Technologie (DUT) en G.E.A..
Année Académique 2015-2016
Semestre 1 Gestion de base de données.
TP
84 Htd
75 étudiants
Semestre 1 Environnement numérique d’information et communication .
responsable principal
34 Htd 24 étudiants
Semestre 4 Systèmes de Gestion de base de données.
TP
32 Htd
50 étudiants
Semestre 4 Tests numériques et logiques.
responsable principal
32 Htd 60 étudiants
Qualification Moniteur, allocataire avec mission d’enseignement.
précédente
Composante Département Informatique, Institut Universitaire de Technologie de Villetaneuse,
Université Paris 13.
Filière Diplôme Universitaire de Technologie (DUT) en Informatique.
Année Académique 2014-2015
Semestre 1 Structures de Données et Algorithmes Fondamentaux.
TD (avec MC inclus), TP & rédaction partiel du support de cours
36 Htd 25 étudiants
Semestre 1 Projet Tutoré en C.
Évaluation
12 Htd 24 étudiants
Semestre 3 Conception et Programmation Orientées à Objets Avancées.
TD & TP
26,5 Htd 25 étudiants
Année Académique 2013-2014
Semestre 1 Structures de Données et Algorithmes Fondamentaux.
TD (avec MC inclus), TP & rédaction partiel du support de cours
36 Htd 25 étudiants
Semestre 2 Introduction aux Interfaces Homme-Machine.
TP
22 Htd
19 étudiants
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
8/9
Année Académique 2012-2013
Semestre 1 Architecture des Ordinateurs.
TD
36 Htd
26 étudiants
Semestre 2 Information et Signaux.
TD
24 Htd
21 étudiants
Other Responsabilities
2015-2016 Co-organizer of the weekly seminar of the research area "Linear Logic
and Programming" for the group Logique, Calcul et Raisonnement,
at LIPN.
Main organizer: Damiano Mazza
B [email protected]
Í https://lipn.univ-paris13.fr/∼ruoppolo
9/9