[TYPES/announce] PLDI 2013: Final Call for Papers

Matt Might might at cs.utah.edu
Thu Oct 25 20:19:08 EDT 2012


*** IMPORTANT DATES ***
Paper submission: 11 November 2012 (16 days away!)
Rebuttal period:  15-17 January 2013
Notification:     5 February 2013
URL:              http://pldi2013.ucombinator.org/


*** INFORMATION ***
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:

+ Language designs and extensions
+ Static and dynamic analysis of programs
+ Domain-specific languages and tools
+ Type systems and program logics
+ Program transformation and optimization
+ Checking or improving the security or correctness of programs
+ Memory management
+ Parallelism, both implicit and explicit
+ Performance analysis, evaluation, and tools
+ Novel programming models
+ Debugging techniques and tools
+ Program understanding
+ Interaction of compilers/runtimes with underlying systems
+ Program synthesis

Submissions must be in ACM SIGPLAN proceedings format, 9-point type,
and may not exceed 10 pages (all inclusive).  Submissions should be
written to allow for double-blind reviewing.

For full submission guidelines, please refer to the web page:

 http://pldi2013.ucombinator.org/


TOPLAS session

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
http://compilers.cs.ucla.edu/toplas/index.html


On behalf of the PLDI 2013 organizers,

Hans Boehm (General Chair)
Cormac Flanagan (Program Chair)


More information about the Types-announce mailing list