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. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation or application of programming languages.

The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG.

POPL 2022 Call for Papers

PACMPL Issue POPL 2022 seeks contributions on all aspects of programming languages and programming systems, both theoretical and practical. Authors of papers published in PACMPL Issue POPL 2022 will be invited to present their work in the POPL conference in January 2022, which is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG.

Scope

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. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation or application of programming languages.

Evaluation Criteria

The Review 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. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page.

Evaluation Process

Authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. A response must be concise, addressing specific points raised in review; in particular, it must not introduce new technical results. Reviewers will write a short reaction to these author responses. The Review Committee will discuss papers entirely electronically rather than at a physical meeting. This will avoid the time, cost, and environmental impact of transporting an increasingly large committee to one point on the globe. There is no formal External Review Committee, though experts outside the committee will be consulted. Reviews will be accompanied by a short summary of the reasons behind the committee’s decision with the goal of clarifying the reasons behind the decision.

For additional information about the reviewing process, see:

To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the Review Committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the Review Committee by the requested deadline or risk rejection.

Submission Guidelines

The following two points are easy to overlook:

  • Conflicts: Each author of a submission has to log into the submission system and properly declare all potential conflicts of interest in the author profile form. A conflict caught late in the reviewing process leads to a voided review which may be infeasible to replace.
  • Anonymity: POPL 2022 will employ a lightweight double-blind reviewing process. Make sure that your submitted paper is fully anonymized.

Prior to the paper submission deadline, the authors will upload their full anonymized paper. Each paper should have no more than 25 pages of text, excluding bibliography, using the new ACM Proceedings format. This format is chosen for compatibility with PACMPL. It is a single-column page layout with a 10 pt font, 12 pt line spacing, and wider margins than recent POPL page layouts. In this format, the main text block is 5.478 in (13.91 cm) wide and 7.884 in (20.03 cm) tall. Use of a different format (e.g., smaller fonts or a larger text block) is grounds for summary rejection. PACMPL templates for Microsoft Word and LaTeX can be found at the SIGPLAN author information page. In particular, authors using LaTeX should use the acmart-pacmpl-template.tex file (with the acmsmall option). Submissions should be in PDF and printable on both US Letter and A4 paper. Papers may be resubmitted to the submission site multiple times up until the deadline, but the last version submitted before the deadline will be the version reviewed. Papers that exceed the length requirement, that deviate from the expected format, or that are submitted late will be rejected.

Deadlines expire at the end of the day, anywhere on earth on the Important Dates displayed to the right. 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.

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

  1. author names and institutions must be omitted, and
  2. 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 Review Committee and external reviewers come to an initial judgment 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. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their paper as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. A document answering frequently asked questions addresses many common concerns.

The submission itself is the object of review and so it should strive to convince the reader of at least the plausibility of reported results. Still, 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 must be uploaded at submission time, as a single pdf or a tarball, not via a URL. Two forms of supplementary material may be submitted.

  1. Anonymous supplementary material is available to the reviewers before they submit their first-draft reviews.
  2. Non-anonymous supplementary material is available to the reviewers after they have submitted their first-draft reviews and learned the identity of the authors.

Use the anonymous form if possible. 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.

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. 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.

Copyright, Publication, and Presentation

As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support libre open access by licensing their work with the Creative Commons Attribution 4.0 International (CC BY) license, which grants readers liberal (re-)use rights.

Authors of accepted papers will be required to choose one of the following publication rights:

  • Author licenses the work with a Creative Commons license, retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice).
  • Author retains copyright of the work and grants ACM a non-exclusive permission to publish license.
  • Author retains copyright of the work and grants ACM an exclusive permission to publish license.
  • Author transfers copyright of the work to ACM.

These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM’s “author pays” option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently, US$400), payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk.

All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. 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 the conference. The official publication date affects the deadline for any patent filings related to published work.

Authors of accepted papers are required to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule.

Distinguished Paper Awards

At most 10% of the accepted papers of POPL 2022 will be designated as Distinguished Papers. This award highlights papers that the Review Committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through a second review process.

Accepted Papers

Title
A Dual Number Abstraction for Static Analysis of Clarke Jacobians
POPL
A Fine-Grained Computational Interpretation of Girard's Intuitionistic Proof-Nets
POPL
A Relational Theory of Effects and Coeffects
POPL
A Separation Logic for Heap Space under Garbage Collection
POPL
A Separation Logic for Negative Dependence
POPL
A cost-aware logical framework
POPL
A formal foundation for symbolic evaluation with merging
POPL
Bottom-up Synthesis of Recursive Functional Programs using Angelic Execution
POPL
Certifying Derivation of State Machines from Coroutines
POPL
Concurrent Incorrectness Separation Logic
POPL
Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic
POPL
Context-Bounded Verification of Thread Pools
POPL
Dependently-Typed Data Plane Programming
POPL
Effectful Program Distancing
POPL
Efficient Algorithms for Dynamic Bidirected Dyck-Reachability
POPL
Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of Intel-x86 Memory Types and Non-Temporal Stores
POPL
Fair termination of binary sessions
POPL
Formal Metatheory of Second-Order Abstract Syntax
POPL
From Enhanced Coinduction towards Enhanced Induction
POPL
Fully abstract models for effectful λ-calculi via category-theoretic logical relations
POPL
Induction Duality: Primal-Dual Search for Invariants
POPL
Interval Universal Approximation for Neural Networks
POPL
Isolation Without Taxation: Near Zero Cost Transitions for WebAssembly and SFI
POPL
Layered and Object-Based Game Semantics
POPL
Learning Logics With Finitely Many Variables
POPL
Linked visualisations via Galois dependencies
POPL
Logarithm and Program Testing
POPL
Moebius: Metaprogramming using Contextual Types
POPL
Oblivious Algebraic Data Types
POPL
Observational Equality: Now For Good
POPL
On Incorrectness Logic and Kleene Algebra With Top and Tests
POPL
On Type-Cases, Union Elimination, and Occurrence Typing
POPL
One Polynomial Approximation to Produce Correctly Rounded Results of an Elementary Function for Multiple Representations and Rounding Modes
POPL
PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations
POPL
Partial (In)Completeness in Abstract Interpretation
POPL
Pirouette: Higher-Order Typed Functional Choreographies
POPL
Profile Inference Revisited
POPL
Property-Directed Reachability as Abstract Interpretation in the Monotone Theory
POPL
Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic Differentiation
POPL
Quantum Information Effects
POPL
Quantum Separation Logic: A Framework for Local Reasoning of Quantum Programs
POPL
Reasoning about “Reasoning about Reasoning”: Semantics and Contextual Equivalence for Probabilistic Programs with Nested Queries and Recursion
POPL
Relational E-Matching
POPL
Pre-print
Return of CFA: Call-Site Sensitivity Can Be Superior to Object Sensitivity Even for Object-Oriented Programs
POPL
Safe, Modular Packet Pipeline Programming
POPL
Semantics for Variational Quantum Programming
POPL
Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimizations
POPL
Software Model-Checking as Cyclic-Proof Search
POPL
SolType: Refinement Types for Solidity
POPL
Solving Constrained Horn Clauses Modulo Algebraic Data Types and Recursive Functions
POPL
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables
POPL
Staging with Class
POPL
Static Prediction of Parallel Computation Graphs
POPL
Subcubic Certificates for CFL Reachability
POPL
Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages
POPL
Pre-print
The Decidability and Complexity of Interleaved Bidirected Dyck Reachability
POPL
The Leaky Semicolon: Compositional Semantic Dependencies for Relaxed-Memory Concurrency
POPL
Truly Stateless, Optimal Dynamic Partial Order Reduction
POPL
Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
POPL
Type-Level Programming with Match Types
POPL
VIP: Verifying Real-World C Idioms with Integer-Pointer Casts
POPL
Verified Compilation of C Programs with a Nominal Memory Model
POPL
Verified Tensor-Program Optimization Via High-level Scheduling Rewrites
POPL
Visibility Reasoning for Concurrent Snapshot Algorithms
POPL
What's Decidable about Linear Loops?
POPL