[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
2nd Scheme workshop
============================================================================
CALL FOR PAPERS
2nd Scheme and Functional Programming
Florence, Italy, 2 Septembre 2001
The workshop forms part of PLI 2001, which consists
of the ICFP and PPDP conferences and other workshops.
http://kaolin.unice.fr/Scheme2001/
============================================================================
Background and Theme:
---------------------
Over the past few years, Scheme and its implementations have made
tremendous progress in support of generative programming, shell
scripting, COMponent support and distributed programming, graphics
and GUI support, OO programming, and various other aspects of
engineering real-world software. We are calling on implementors and
users of Scheme systems to share their ideas at a 2nd Scheme workshop
during PLI 2001 in Florence.
The organizers goal is to attract presentations on a broad spectrum
of topics:
* applications
* environments
* extensions
* implementations
* logics (predicate types)
* programs
The committee will consider submissions concerning Scheme and other
functional languages (Erlang, Haskell, LISP, ML, Caml, etc.).
Submission details
------------------
Deadline for submission: 15 June 2001
The organizers seek two kinds of presentations:
* regular: These presentations are like conventional workshop and
conference presentation.
* short: These presentations last up to 15 mins and are on
unconventional topics. Examples include unusual applications,
nifty Scheme programming tricks, ideas on implementations,
designs and requests for implementations, etc.
Program committee
------------------
William D Clinger, Northeastern University
Matthew Flatt, University of Utah
Christian Queinnec, Université Pierre et Marie Curie, Paris
Manuel Serrano, Université de Nice
Michael Sperber, Universität Tübingen
Pierre Weis, INRIA-Rocquencourt
Details
-------
http://kaolin.unice.fr/Scheme2001/
============================================================================