The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Papers discussing new ideas and new areas are encouraged, as are papers (often called "pearls") that elucidate existing concepts in ways that yield new insights. We are looking for any submission with the potential to make enduring contributions to the theory, design, implementation or application of programming languages.

Evaluation

The program committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity.

Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. Hence, we encourage the submission of pearls: elegant essays that explain an old idea, but do so in a new way that clarifies the idea and yields new insights. There is no formal separation of categories; pearls will be held to the same standards as any other paper.

Each paper should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make their papers understandable to a broad audience. Advice on writing technical papers can be found on the SIGPLAN author information page.

A document that details principles underlying organizational and reviewing policies can be found here.

A document containing frequently asked questions about the reviewing and submission process, especially as it pertains to double-blind reviewing, can be found here.

Important Dates

Paper registration	3 July 2015, AOE
Paper submission	10 July 2015, AOE
Submission URL	https://popl16.hotcrp.com/
Author response period	17 September, 12:00 noon CET - 20 September, 11:00pm CET
Author notification	05 October 2015
Camera-ready deadline	05 November 2015
Main conference	20-22 January 2016
Co-located events	17-19, 23 January 2016

Submission guidelines

Prior to the registration deadline, the authors will register their paper by uploading information on the submission title, abstract (of at most 300 words), authors, topics, and conflicts to the conference web site. Papers that are not registered on time will be rejected.

Prior to the final paper submission deadline, the authors will upload their full paper in double blind format and formatted according to the ACM proceedings format. Each paper should have no more than 12 pages of text, excluding bibliography, in at least 9 pt format. Papers may be resubmitted multiple times up until the deadline. The last version submitted before the deadline will be the version that is reviewed. Papers that exceed the length requirement or are submitted late will be rejected. All deadlines are firm.

We encourage authors to provide any supplementary material that is required to support the claims made in the paper, such as detailed proofs, proof scripts, or experimental data. These materials should be uploaded at submission time, as a single pdf or a tarball, not via a URL. It will be made available to reviewers only after they have submitted their first-draft reviews and hence need not be anonymized. Reviewers are under no obligation to look at the supplementary material but may refer to it if they have questions about the material in the body of the paper.

Templates for ACM format are available for Word Perfect, Microsoft Word, and LaTeX at http://www.sigplan.org/Resources/Author (use the 9 pt preprint template). Submissions should be in PDF and printable on US Letter and A4 sized paper.

Submitted papers must adhere to the SIGPLAN Republication Policy and the ACM Policy on Plagiarism. Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed.

AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.)

POPL 2016 will employ a lightweight double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules:

author names and institutions must be omitted, and
references to authors' own related work should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ...").

The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. 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). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. David Walker has put together a document answering frequently asked questions that should address many common concerns.

ARTIFACT EVALUATION: Authors of accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. This submission is voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Additional information is to be found on the POPL AEC web page. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as "source materials" in the ACM Digital Library.

Accepted Papers

	Title
	'Cause I'm Strong Enough: Reasoning about Consistency Choices in Distributed Systems Alexey Gotsman, Hongseok Yang, Carla Ferreira, Mahsa Najafzadeh, Marc Shapiro Media Attached
	A Program Logic for Concurrent Objects under Fair Scheduling Hongjin Liang, Xinyu Feng Media Attached
	A Theory of Effects and Resources: Adjunction Models and Polarised Calculi Pierre-Louis Curien, Marcelo Fiore, Guillaume Munch-Maccagnoni
	A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions Jean Pichon-Pharabod, Peter Sewell File Attached
	Abstracting Gradual Typing Ronald Garcia, Alison M. Clark, Éric Tanter Link to publication Media Attached
	Abstraction Refinement Guided by a Learnt Probabilistic Model Radu Grigore, Hongseok Yang Media Attached
	Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs Krishnendu Chatterjee, Hongfei Fu, Rouzbeh Hasheminezhad, Petr Novotny Media Attached
	Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis Media Attached
	Binding as Sets of Scopes Matthew Flatt Pre-print Media Attached
	Breaking Through the Normalization Barrier: A Self-Interpreter for F-omega Matt Brown, Jens Palsberg Media Attached File Attached
	Casper: An Efficient Approach to Call Trace Collection rongxin wu, Xiao Xiao, Shing-Chi Cheung, Hongyu Zhang, Charles Zhang Media Attached
	Certified Causally Consistent Distributed Key-Value Stores Mohsen Lesani, Christian J. Bell, Adam Chlipala Media Attached
	Combining Static Analysis with Probabilistic Models to Enable Market-Scale Analysis Damien Octeau, Somesh Jha, Matthew Dering, Patrick McDaniel, Alexandre Bartel, Hongyu Li, Jacques Klein, Yves Le Traon Media Attached
	Decidability of Inferring Inductive Invariants Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv Media Attached
	Dependent Types and Multi-Monadic Effects in F* Nikhil Swamy, Cătălin Hriţcu, Chantal Keller, Aseem Rastogi, Antoine Delignat-Lavaud, Simon Forest, Karthikeyan Bhargavan, Cédric Fournet, Pierre-Yves Strub, Markulf Kohlweiss, Jean-Karim Zinzindohoué, Santiago Zanella-Béguelin Pre-print Media Attached
	Effects as sessions, sessions as effects Dominic Orchard, Nobuko Yoshida Pre-print Media Attached
	Environmental Bisimulations for Probabilistic Higher-Order Languages Davide Sangiorgi, Valeria Vignudelli Media Attached
	Estimating types in binaries using predictive modeling Omer Katz, Ran El-Yaniv, Eran Yahav Media Attached File Attached
	Example-Directed Synthesis: A Type-Theoretic Interpretation Jonathan Frankle, Peter-Michael Osera, David Walker, Steve Zdancewic Pre-print Media Attached File Attached
	Fabular: Regression Formulas as Probabilistic Programming Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio Russo, Adam Ścibior, Marcin Szymczak Media Attached
	From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes Ed Robbins, Andy King, Tom Schrijvers Media Attached
	Fully-Abstract Compilation by Approximate Back-Translation Dominique Devriese, Marco Patrignani, Frank Piessens Pre-print Media Attached
	Is Sound Gradual Typing Dead? Asumu Takikawa, Daniel Feltey, Ben Greenman, Max New, Jan Vitek, Matthias Felleisen Pre-print Media Attached File Attached
	Kleenex: Compiling Nondeterministic Transducers to Deterministic Streaming Transducers Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen, Kristoffer Aalund Søholm, Sebastian Paaske Tørholm Media Attached
	Lattice-Theoretic Progress Measures and Coalgebraic Model Checking Ichiro Hasuo, Shunsuke Shimizu, Corina Cirstea Media Attached
	Learning Invariants using Decision Trees and Implication Counterexamples Pranav Garg, Daniel Neider, P. Madhusudan, Dan Roth Media Attached
	Learning Programs from Noisy Data Veselin Raychev, Pavol Bielik, Martin Vechev, Andreas Krause Link to publication DOI Pre-print Media Attached File Attached
	Lightweight Verification of Separate Compilation Jeehoon Kang, Yoonseung Kim, Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis Media Attached File Attached
	Maximal Specification Synthesis Aws Albarghouthi, Isil Dillig, Arie Gurfinkel Pre-print Media Attached
	Memoryful Geometry of Interaction II: Recursion and Adequacy Koko Muroya, Naohiko Hoshino, Ichiro Hasuo Media Attached
	Model Checking for Symbolic-Heap Separation Logic with Inductive Predicates James Brotherston, Nikos Gorogiannis, Max Kanovich, Reuben Rowe
	Modelling the ARMv8 Architecture, Operationally: Concurrency and ISA Shaked Flur, Kathryn E. Gray, Christopher Pulte, Susmit Sarkar, Luc Maranget, Ali Sezgin, Will Deacon, Peter Sewell Media Attached File Attached
	Monitors and Blame Assignment for Higher-Order Session Types Limin Jia, Hannah Gommerstadt, Frank Pfenning Media Attached File Attached
	Newtonian Program Analysis via Tensor Product Thomas Reps, Emma Turetsky, Prathmesh Prabhu Media Attached
	Optimizing Synthesis with Metasketches James Bornholt, Emina Torlak, Dan Grossman, Luis Ceze Pre-print Media Attached
	Overhauling SC atomics in C11 and OpenCL John Wickerson, Mark Batty, Alastair Donaldson Pre-print File Attached
	PSync: a partially synchronous language for fault-tolerant distributed algorithms Cezara Drăgoi, Thomas A. Henzinger, Damien Zufferey Link to publication DOI Pre-print Media Attached File Attached
	PolyCheck: Dynamic Verification of Iteration Space Transformations on Affine Programs Wenlei Bao, Sriram Krishnamoorthy, Louis-Noel Pouchet, Fabrice Rastello, P. (Saday) Sadayappan Media Attached
	Principal Type Inference for GADTs Sheng Chen, Martin Erwig Media Attached
	Printing Floating-Point Numbers: A Faster, Always Correct Method Marc Andrysco, Ranjit Jhala, Sorin Lerner Media Attached
	Prophet: Automatic Patch Generation via Learning from Successful Patches Fan Long, Martin Rinard Media Attached
	Pushdown Control-flow Analysis for Free Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn Pre-print Media Attached
	Query-Guided Maximum Satisfiability Xin Zhang, Ravi Mangal, Aditya Nori, Mayur Naik File Attached
	Reducing Crash Recoverability to Reachability Eric Koskinen, Junfeng Yang
	SMO: An Integrated Approach to Intra-Array and Inter-Array Storage Optimization Somashekaracharya G Bhaskaracharya, Uday Bondhugula, Albert Cohen Media Attached File Attached
	Scaling Network Verification using Symmetry and Surgery Gordon Plotkin, Nikolaj Bjørner, Nuno P. Lopes, Andrey Rybalchenko, George Varghese
	Sound Type-dependent Syntactic Language Extension Florian Lorenzen, Sebastian Erdweg Pre-print Media Attached File Attached
	String Solving with Word Equations and Transducers: Decidability and Applications to Detecting Mutation XSS Anthony Widjaja Lin, Pablo Barcelo Media Attached
	Symbolic Abstract Data Type Inference Michael Emmi, Constantin Enea Media Attached
	Symbolic Computation of Differential Equivalences Luca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin Media Attached
	System Fω with Equirecursive Types for Datatype-generic Programming Yufei Cai, Paolo G. Giarrusso, Klaus Ostermann Media Attached
	Taming Release-Acquire Consistency Ori Lahav, Nick Giannarakis, Viktor Vafeiadis Pre-print Media Attached File Attached
	Temporal Verification of Higher-order Functional Programs Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno
	The Complexity of Interaction Stéphane Gimenez, Georg Moser Media Attached
	The Gradualizer: a methodology and algorithm for generating gradual type systems Matteo Cimini, Jeremy G. Siek Media Attached
	The Hardness of Data Packing Rahman Lavaee, Chen Ding Media Attached
	Transforming Spreadsheet Data Types using Examples Rishabh Singh, Sumit Gulwani Media Attached
	Type Theory in Type Theory using Quotient Inductive Types Thorsten Altenkirch, Ambrus Kaposi Media Attached File Attached
	Unboundedness and Downward Closures of Higher-Order Pushdown Automata Matthew Hague, Jonathan Kochems, C.-H. Luke Ong Media Attached