Related articles |
---|
Second CFP Papers: ML Workshop 2005 (Estonia, Sep 05) blume@tti-c.org (Matthias Blume) (2005-05-18) |
From: | Matthias Blume <blume@tti-c.org> |
Newsgroups: | comp.compilers |
Date: | 18 May 2005 12:19:17 -0400 |
Organization: | Compilers Central |
Keywords: | functional, conference, CFP |
Posted-Date: | 18 May 2005 12:19:17 EDT |
Call for Papers
The 2005 ACM SIGPLAN Workshop on ML
http://ttic.uchicago.edu/~blume/ml05/
To be held in conjunction with ICFP 2005
September 29, 2005
Tallinn, Estonia
The ML family of programming languages, whose dialects include
Standard ML, Objective Caml, Alice ML and nML, has inspired a
tremendous amount of language research, ranging from type inference
to module systems to operational semantics and implementation.
Languages from the ML family have alse been successfully applied in
areas ranging from compilers and theorem provers to low-level system
software, web applications and video games.
The goal of the Workshop is to provide a forum for researchers,
developers, and users to hear about and discuss the latest work on the
use, design, and implementation of ML-like languages. Previous ML
Workshops have been held in Edinburgh, Pittsburgh, San Francisco,
Orlando and Baltimore.
The 2005 Workshop will be held in conjunction with the ACM SIGPLAN
International Conference on Functional Programming (ICFP) in Tallinn,
Estonia. We seek papers on any ML-related topic, including (but not
limited to):
* applications
* extensions: objects, classes, concurrency, distribution and mobility,
semi-structured data handling, etc.
* type systems: inference, modules, specification, error reporting, etc.
* implementation: compilers, interpreters, partial evaluators,
garbage collectors, etc.
* environments: libraries, tools, editors, debuggers,
cross-language interoperability, etc.
* semantics
Submitted papers should describe new ideas, experimental results, or
informed positions regarding proposals for next-generation ML languages.
In order to encourage lively discussion, submitted papers may describe
work in progress. Proceedings will be published as a volume of
Electronic Notes in Theoretical Computer Science (ENTCS).
General Chair:
Matthias Blume, Toyota Technological Institute at Chicago
Program Chairs:
Nick Benton Xavier Leroy
Microsoft Research Limited INRIA Rocquencourt
7 J J Thomson Avenue B.P. 105
Cambridge CB3 0FB 78153 Le Chesnay
United Kingdom France
E-mail: nick at microsoft.com E-mail: Xavier.Leroy at inria.fr
Program Committee:
Nick Benton (co-chair) Microsoft Research
Matthias Blume Toyota Technological Institute at Chicago
Martin Elsman IT University of Copenhagen
Jean-Christophe Filliâtre CNRS, University Paris Sud
Robert Harper Carnegie Mellon University
Xavier Leroy (co-chair) INRIA Rocquencourt
Chris Okasaki United States Military Academy
John Reppy University of Chicago
Andreas Rossberg Universität des Saarlandes
Zhong Shao Yale University
Eijiro Sumii University of Pennsylvania
Stephen Weeks
Kwangkeun Yi Seoul National University
Important Dates:
* Submission Deadline: June 10, 2005
* Notification of acceptance: July 15, 2005
* Final paper due: Sept 5, 2005
* Workshop: September 29, 2005
Proceedings:
The Workshop proceedings will be published as a volume of Elsevier
Electronic Notes in Theoretical Computer Science (ENTCS). A
preliminary proceedings will also be distributed at the Workshop.
Submission Procedure:
Contributions, in English and not to exceed 14 pages in ENTCS format,
should be submitted via the Web interface at
http://ttic.uchicago.edu/~blume/ml05/ by Friday, June 10, 2005.
Submissions must be in PDF or Postscript form. The Postscript
should be interpretable by Ghostscript, use standard fonts (or include
the necessary fonts), and print correctly on US letter paper (8.5x11
inches). Use of the ENTCS style files (available from the workshop Web
site) for initial submissions is strongly encouraged.
Notification of the acceptance or rejection of papers will be given by
Friday, July 15, 2005.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.