Teaching:
Algorithms and
Data Structures, '04
Laboratory I of
Informatics, '04
Advanced Functional
Programming, '04
About me:
I'm Leonor Lopez and Jorge Russo's son and Martín and
Barbarina's brother. I´m a
Licentiate in Computer Science . My graduate
work was title
Principal Type Specialization of Dynamic Sum-Types
, my Supervisor was
Fidel (Pablo E. Martínez López).
Additionally, I have done other activities that you can
see below on this page. My primary
research area is Type Specialization,
and Functional Programming, Type Theory, and Formal
Methods for constructing software are my general research
interests.
Curriculum vitae:
Here you can download my curriculum vitae (
english
/
spanish
version)
in order to know more about me.
Activities
Teaching:
I have been teaching at the career of
Licenciate in Computer Science
since 1999.
The courses I've participated in such
as Instructor (part time) or Teaching Assistant are:
Advanced Functional Programing,
Algorithms and Data Structures,
Analysis of Programming Languages(Functional
Programming),
Discrete Mathematics,
Concrete Mathematics (D. Knuth)
and
Introduction to Informatics.
For more information about the career
click
here.
I have also been teaching at the career of
Universitary Computing Analyst
since 2000. I'm Instructor of the courses
Laboratory I of Informatics (Introduction to
Linux / Shell Programming)
and
Laboratory II of Informatics (C Language
Programming).
For more information about the career
click
here.
Research:
Principal Type Specialization: my graduate thesis
is related to a particular form of program transformation,
which is Partial Evaluation. In 1996, John Hughes
introduced a different form of program specialization
as a solution for optimal specialization of typed
interpreters. It has also proved to be a rich approach
to program specialization. However, his approach has some
undesirable consequences, as example
lack of principality.
Pablo E. Martínez López fixed this problems for a subset
of the language presented by John Hughes. He removed the
inherited limit of polymorphism and proved that his syntax
directed system has a notion of principality, called
principal specialization. My work consists of introducing
to his system two rules for
dealing with dynamic sum-types, which is the first step
to be able to write self-interpreters for untyped languages in
the principal type specialisation framework.
The prototype can be download here . It performs
principal type specialisation involving dynamic sum-types.
This prototype is just
an extension of Fidel's prototype.
New : an extended version of my technical report
is given here. Basically, I added two new chapters:
Constraint Solving and Simplification , and
An Interpreter with Error Handling .
Download it
Primer Congreso Nacional de Software Libre - USUARIA 2004
: Martín Carr and I gave a lecture related to
free software for windows in the First National Congress
of Free Software - USUARIA 2004. The slides that we used
are avaliable in Spanish
(
sxi
). May 2004.
Managerial:
Member of the Assesor Council of Exact Science
School, which involves Mathematics, Physics and
Computer Science Departments,
teachers´ representer.
Member of the Assesor Council of Computer Science
Department,
teachers´ representer.
Other Materials And Software
Cites: I usually start my lessons with a cite that is related
to the subject I´m going to teach.
Here
you can find them (in Spanish).
Generating Particular Lineal Restrictions :
Here
is a program for generating specific
lineal restrictions for
LINDO Software
.
This program was made for
Ph.D. Graciela Nasini
, who is a researcher at the Mathematic Department.
It was written in Haskell (hugs) and shows the use of
pretty printing library, Input/Out Monad and
comprehesion lists.
Syntax Directed Security Type System :
At
WSSA'03
I attended to a security course given by Ph. D.
Andrei Sabelfeld. He showed
a non-syntax directed security-type system
(explained in
Language-Based Information-Flow Security
,
Page 5). I made a syntax directed ``equivalent''
version of that (using qualified types). This last fact
enables us to process (or detect) information
about programs in a modular way, without needing
to have all the modules of a system for detecting
information-flow.
Here
you can find a prototype (version 0.1 :) ), written in
Haskell (hugs),
that implements my ideas.
If you are interested in formal aspects,
here
you can find the formal rules I used. All suggestions
are welcomed!.
Free Software :
I've been participating in a project, which is
supported by Students' Union,
for promoting the use of free software at University.
Here
you can find an article (in Spanish) I wrote about this
subject. For more information, please, visit the Project's
homepage
Monad Transformers : Monad transformers allow us
to capture the essence of language features individually
(state, error handling, input/output,...).
I wrote down a very simple example that uses state and
error monad transformers in order to show how they
are used.
Here
you can download an example (written in hugs).
For more information take a look at
Monad Transformers and Modular Interpreters, S. Liang, P. Hudak
and Mark P. Jones, Pages 6-8
Introduction to Latex :
I taught a basic course of Latex last May. The course
consists on three lectures (in Spanish).
Here you can download them
(
1 lecture ,
2 lecture ,
3 lecture ,
)