Related articles |
---|
POPL 2006 Call for Papers (Charleston SC, Jan 06) dpw@cs.princeton.edu (2005-05-31) |
From: | dpw@cs.princeton.edu |
Newsgroups: | comp.arch,comp.compilers,comp.constraints,comp.lang.misc,comp.lang.perl.misc |
Date: | 31 May 2005 21:44:28 -0400 |
Organization: | http://groups.google.com |
Keywords: | conference, CFP |
Posted-Date: | 31 May 2005 21:44:28 EDT |
*********************************************************************
* ACM SIGPLAN-SIGACT Symposium *
* on *
* Principles of Programming Languages *
* *
* January 11-13, 2006 *
* Charleston Place Hotel *
* Charleston, South Carolina *
* *
* Call for Papers *
* *
* http://www.cs.princeton.edu/~dpw/popl/06/ *
*********************************************************************
Important dates
* Submission deadline: 23:00 18 July, 2005 Samoan time
* Author review period: 23:00 12 Sept to 23:00 14 Sept, 2005, Samoan
time
* Author notification: 26 Sept, 2005
* Final paper due: To be announced.
Scope
The annual Symposium on Principles of Programming Languages is a forum
for the discussion of fundamental principles and important innovations
in the design, definition, analysis, transformation, implementation and
verification of programming languages, programming systems, and
programming abstractions. Both experimental and theoretical papers on
principles and innovations are welcome, ranging from formal frameworks
to reports on practical experiences.
Submissions on a diversity of topics are sought, particularly ones that
identify new research directions. POPL 2006 is not limited to topics
discussed in previous symposia. Authors concerned about the
appropriateness of a topic may communicate by electronic mail with the
program chair prior to submission.
Submission guidelines
Due date & time: Submissions must be filed at the web site by 23:00
Monday 18 July, Apia, Samoa time. Some equivalents to this time are
* New York: 5:00 AM = 5h00 (19 July)
* San Francisco: 2:00 AM = 2h00 (19 July)
* Chicago: 4:00 AM = 4h00 (19 July)
* Paris: Noon (19 July)
* Hong Kong: 6:00 PM = 18h00 (19 July)
* UTC: 10:00 AM (19 July)
Submission URL: To be announced. Check the main POPL 2006 website.
Authors should submit a 100-200 word abstract and a full paper by 23:00
Apia, Samoa Time on Monday, 18 July, 2005. Submissions should be no
more than 12 pages (including bibliography) in standard ACM SIGPLAN
conference format: two columns, nine-point font on a ten-point
baseline, with pages 20pc (3.33in) wide and 54pc (9in) tall, with a
column gutter of 2pc (0.33in). Detailed formatting guidelines are
available at http://www.acm.org/sigs/sigplan/authorInformation.htm,
along with formatting templates or style files for LaTeX. You don't
need to include categories, keywords, etc., though you are welcome to
do so. Also, note that the ACM copyright notice is not required of
submissions, only of accepted papers.
Authors wishing to supply additional material to the reviewers beyond
the 12-page limit can do so in clearly marked appendices, on the
understanding that reviewers are not required to read the appendices.
Submissions that do not meet these guidelines will not be considered.
The submission deadline and length limitations are firm.
Submissions will be carried out electronically via the Web, at the URL
given above. Papers must be submitted in either PDF format or as
PostScript documents that are interpretable by Ghostscript. They must
be printable on US Letter sized paper. Individuals for which this
requirement is a hardship should contact the program chair at least one
week before the deadline.
Submitted papers must adhere to SIGPLAN's republication policy. Each
paper should explain its contributions in both general and technical
terms, clearly identifying what has been accomplished, explaining why
it is significant, and comparing it with previous work. Authors should
strive to make the technical content of their papers understandable to
a broad audience.
Authors will be given a 2-day period (23:00 12 Sept. to 23:00 14 Sept.
2005 Samoa time) to read and respond to the reviews for their papers
before the PC meeting. Authors of submitted papers will receive more
details from the submission site.
Authors of accepted papers will be required to sign the ACM copyright
form. Proceedings will be published by ACM Press.
Student Attendees
Students who have a paper accepted for the conference are offered
student membership of SIGPLAN free for one year. As members of SIGPLAN
they may apply for travel fellowships from the PAC fund.
Conference Chair
Greg Morrisett
Harvard University
33 Oxford Street
Cambridge, MA 02138 USA
greg at eecs dot harvard dot edu
Program Chair
Simon Peyton Jones
Microsoft Research Ltd,
7 JJ Thomson Ave,
Cambridge CB3 0FB, UK
simonpj@microsoft.com
Program Committee
* Giuseppe Castagna, CNRS, LIENS, ENS Paris
* Manuel Chakravarty, University of New South Wales
* Karl Crary, Carnegie Mellon University
* Sophia Drossopoulou, Imperial College London
* Paul Feautrier, ENS Lyon
* Carl A Gunter, University of Illinois
* Rajiv Gupta, University of Arizona
* Fritz Henglein, DIKU, University of Copenhagen
* Trevor Jim, AT&T
* Shriram Krishnamurthi, Brown University
* Gary T Leavens, Iowa State
* Robert O'Callahan, Novell
* Peter O'Hearn, Queen Mary, University of London
* Andreas Podelski, Max Planck Institute, Saarbrücken
* Andrei Sabelfeld, Chalmers University
* Kostis Sagonas, Uppsala University
* Davide Sangiorgi, University of Bologna
* Philip Wadler, University of Edinburgh
* Stephanie Weirich, University of Pennsylvania
* Hongwei Xi, Boston University
Affiliated Events
* Foundations of Object Oriented Languages (FOOL)
* January 14, 2006
* Partial Evaluation and Semantics-Based Program Manipulation (PEPM)
* January 9-10, 2006
* Practical Applications of Declarative Languages (PADL)
* January 9-10, 2006
* Programming Language Technologies for XML (PLAN-X)
* January 14, 2006
* Semantics, Program Analysis and Computing Environments
for Memory Management (SPACE 2006)
* January 14, 2006
* Verification, Model Checking and Abstract Interpretation (VMCAI)
* January 8-10, 2006
Return to the
comp.compilers page.
Search the
comp.compilers archives again.