+------------------------------------------------------------+
| CALL FOR PAPERS |
| 6th European Lisp Workshop |
| July 6, Genova, Italy - co-located with ECOOP 2009 |
+------------------------------------------------------------+
Important Dates
===============
Submission deadline: April 08, 2009
Notification of acceptance: May 08, 2009
ECOOP early registration deadline: May 20, 2009
6th European Lisp Workshop: July 06, 2009
Please note that registration must be done with ECOOP itself.
For more information visit http://elw.bknr.net/2009
Contact: Didier Verna, didier(a)lrde.epita.fr
2009 Special News
=================
This year, and for the first time, the workshop proceedings will be
published in the ACM Digital Library. Also, the workshop will feature
interactive tutorial/demo/coding sessions (see below).
Overview
========
"...Please don't assume Lisp is only useful for Animation and
Graphics, AI, Bio-informatics, B2B and E-Commerce, Data Mining,
EDA/Semiconductor applications, Expert Systems, Finance, Intelligent
Agents, Knowledge Management, Mechanical CAD, Modeling and Simulation,
Natural Language, Optimization, Research, Risk Analysis, Scheduling,
Telecom, and Web Authoring just because these are the only things they
happened to list."
-- Kent Pitman
Lisp, one of the eldest computer languages still in use today, is
gaining momentum again. The structure of Lisp makes it easy to extend
the language or even to implement entirely new dialects without
starting from scratch, making it the ideal candidate for writing
Domain Specific Languages. Common Lisp, with the Common Lisp Object
System (CLOS), was the first object-oriented programming language to
receive an ANSI standard and retains the most complete and advanced
object system of any programming language, while influencing many
other object-oriented programming languages that followed.
This workshop will address the near-future role of Lisp-based
languages in research, industry and education. We solicit
contributions that discuss the opportunities Lisp provides to capture
and enhance the possibilities in software engineering. We want to
promote lively discussion between researchers proposing new approaches
and practitioners reporting on their experience with the strengths and
limitations of current Lisp technologies.
The workshop will have two components: there will be formal talks, and
interactive turorial/demo/coding sessions.
Papers
======
Formal presentations in the workshop should take between 20 minutes
and half an hour; additional time will be given for questions and
answers. Suggested topics include (but are not limited to):
- Experience reports / Case studies
- Educational approaches
- Software Evolution
- Development Aids
- Persistent Systems
- Dynamic Optimization
- Implementation techniques
- Hardware Support
- Efficiency / Distribution / Parallel programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Protocol Meta-programming and Libraries
- Context-Oriented, Domain-Oriented and Generative Programming
Interactive Tutorial/Demo/Coding Sessions
=========================================
Additionally, we invite less formal talks in the form of interactive
tutorial/demo/coding sessions. The purpose of these sessions is to
both demonstrate and receive feedback on any interesting Lisp system,
either stable or under development. Being less formal than technical
paper presentations, it is expected that these sessions be highly
interactive.
Submission Guidelines
=====================
Potential contributors are encouraged to submit:
- a long paper (around 10 pages) presenting scientific and/or
empirical results about Lisp-based uses or new approaches for
software engineering purposes,
- a short essay (5 pages) defending a position about where
research, practice or education based on Lisp should be heading in
the near future,
- a proposal for an interactive tutorial/demo/coding session (1-2
pages) describing the involved library or application, and the
subject of the session.
Papers (both long and short) should be formatted following the ACM
SIGS guidelines (see
http://www.acm.org/sigs/publications/proceedings-templates) and
include ACM classification categories and terms (see
http://www.acm.org/about/class/1998). Authors will later be required
to sign an ACM copyright form.
Submissions should be mailed as PDF to Didier Verna
(didier(a)lrde.epita.fr) before the submission deadline.
Organizers
==========
Didier Verna, EPITA Research and Development Laboratory, Paris
Charlotte Herzeel, Programming Technology Lab, Vrije Universiteit, Brussel
Robert Strandh, LaBRI, University of Bordeaux I, France
Christophe Rhodes, Goldsmiths College, University of London
Hans Hübner, Software Developer, Berlin
--
European Lisp Symposium, May 2009: http://www.european-lisp-symposium.org
European Lisp Workshop, July 2009: http://elw.bknr.net/2009
Scientific site: http://www.lrde.epita.fr/~didier
Music (Jazz) site: http://www.didierverna.com
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 25 mars 2009 (14h-15h30).
Au programme:
* 14h: Que se cache-t-il derrière ce type ?
-- Yann Régis-Gianas, laboratoire PPS (Univ. Paris Diderot),
équipe πr² (INRIA) http://www.pps.jussieu.fr/~yrg
Si une fonction φ promet de manipuler une valeur de type α sans
l'observer, on peut utiliser son code sans risque pour toutes les
affectations possibles de α : que la valeur soit entière (α =
int) ou
qu'elle soit un arbre (α = tree), la fonction se comportera
toujours de
façon identique. Cette propriété s'appelle le polymorphisme
paramétrique, l'essence de la généricité.
Promettre de ne pas observer de trop près son argument est un
fardeau
parfois insupportable pour une fonction, pour des raisons
algorithmiques
(comment prendre une décision sans savoir ce que vaut mon
argument ?),
ou encore pour des raisons de performances de bas-niveau (si je
sais que
α = int, je peux utiliser une primitive dédiée de mon
processeur).
Même si le type d'une valeur est caché derrière un type plus
abstrait
α, on peut fournir des mécanismes pour « le redécouvrir »
grâce à
des tests dynamiques ou à des raisonnements purement statiques. La
propriété qui permet de diriger son calcul par la forme des types
est
appelée le polymorphisme intentionnel.
Dans cet exposé, nous présenterons plusieurs versions du
polymorphisme
intentionnel offertes par différents systèmes de types et de
preuves
sûrs (c'est-à-dire garantissant que les programmes ne peuvent pas
planter et sont corrects vis-à-vis de leur spécification).
Yann Régis-Gianas est maître de conférence de l'Université
Paris
Diderot. Ancien élève de l'EPITA et du LRDE (promo CSI 2003), il a
poursuivi son cursus par un DEA SPL (précurseur de l'actuel MPRI)
et
par un doctorat au sein de l'équipe Gallium de l'INRIA. Il étudie
le
design des langages de programmation à typage statique garantissant
l'absence d'erreurs dans les programmes.
Pour plus de renseignements, consultez http://seminaire.lrde.epita.fr/.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible.
