The tutorial program enhances the technical program by providing a day of half-day tutorials offered in parallel tracks. Tutorials for PLDI 2013 are solicited on any topic relevant to the PLDI audience. In particular, tutorials that strive to do one of the following have been particularly successful in the past:
For examples of past tutorials, see (among others) the websites of PLDI 2012, PLDI 2011, and PLDI 2010.
In 2013, tutorials will be held on Sunday June 16, 2013 (the day before the main conference). We expect half-day tutorials (3 hours plus a break).
For each accepted tutorial, one presenter will receive complimentary registration to PLDI.
We are investigating low-cost options for video-recording tutorials if and only if tutorial presenters wish.
Submissions should be in pdf or plain-text, sent via email to Dan Grossman (email@example.com, with subject line "PLDI tutorial proposal") with the following information:
Questions should be emailed to the PLDI 2013 Tutorials Chair, Dan Grossman, firstname.lastname@example.org
PLDI is a forum for the exchange of information on programming languages, their design, implementation, development, and use. PLDI emphasizes innovative and creative approaches to compile-time and runtime technology, novel language designs and features, and results from implementations. Papers are solicited on, but not limited to, the following topics:
Submissions are now being accepted:
Submissions must be in ACM proceedings format, 9-point type, and may not exceed 10 pages (all inclusive). Word and LaTeX templates for this format are available at
Submissions must be in PDF and printable on US Letter and A4 sized paper.
To enable double-blind reviewing, author names and their affiliations must be omitted from submissions, and references to related work by the authors should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). However, nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). If you have questions about the logistics for the double-blind reviewing process, please look at the FAQ page.
Papers must describe unpublished work that is not currently submitted for publication elsewhere as discussed at
Authors of accepted papers will be required to sign an ACM copyright release.
The program committee and the external review committee will evaluate the technical contribution of each submission as well as its general accessibility to the PLDI audience. Papers will be judged on significance, originality, and clarity. The paper must be organized so that it is easily understood by an audience with varied expertise. The paper should clearly identify what has been accomplished, why it is significant, and how it relates to previous work.
As part of publishing accepted papers in the ACM Digital Library, we are encouraging authors to submit with their final manuscripts software and experimental data that was used to derive the results of their paper. This type of information is important for archival purposes and can be used by others to replicate the experiments or otherwise gain a deeper knowledge of the work.
This year's PLDI will include a session presenting recent TOPLAS papers. Original papers submitted to TOPLAS before October 1, 2012 can be considered for presentation at PLDI 2013; authors should put a note in their cover letter to indicate interest. These papers will not appear in the PLDI proceedings. For more information, see
This year's PLDI will include a session presenting recent TOPLAS papers.
Please note that these papers will not appear in the PLDI proceedings.
Original papers submitted to TOPLAS before October 1, 2012 can be considered for presentation at PLDI 2013; authors should put a note in their coverletter to indicate interest.
Every effort will be made to make a decision by the PLDI 2013 notification date, provided authors return revisions within the requested number of weeks. For more information, see: