[Prev][Next][Index][Thread]
Scheme and Functional Programming 2000
CALL FOR PAPERS
Scheme and Functional Programming
Montreal, Canada, 17 September 2000
The workshop forms part of PLI 2000, which consists
of the ICFP and PPDP conferences and other workshops.
http://www.cs.rice.edu/~matthias/Scheme2000/
NOTE: [The Web page now contains instructions for submission.]
============================================================================
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 workshop during
PLI 2000 in Montreal.
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, XML, etc.).
Submission details
------------------
Deadline for submission: 15 June 2000
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
------------------
Kent Dybvig, Indiana University
Marc Feeley, Université de Montréal
Matthias Felleisen, Rice University
Daniel Friedman, Indiana University
Manuel Serrano, Université de Nice (Sophia-Antipolis)
Olin Shivers, Massachusetts Institute of Technology
Details
-------
http://www.cs.rice.edu/~matthias/Scheme2000/
============================================================================