News

• PPDP 2021 Proceedings is published in the ACM Digital Library
  DOI: https://dl.acm.org/doi/proceedings/10.1145/347939
  ISBN: 978-1-4503-8689-0
• The program is now available
• Proceedings will be published in the ACM International Conference Proceedings Series
• The PPDP Most Influential Paper 10-Year Award is given to Dependent session types via intuitionistic linear type theory, by Bernardo Toninho, Luís Caires, Frank Pfenning
• The list of accepted papers is now available
• Conference is in cooperation with ACM In-Cooperation, SIGPLAN, and SIGLOG
• Deadline extension
• The conference will be held as a hybrid (blended) meeting, both in-person and virtual. More information is at PPDP-LOPSTR . (23 April 2021)

Invited Speakers

• Marco Gaboardi, Boston University (PPDP invited speaker)
  Programming Languages Techniques for Controlling Generalization Errors in Adaptive Data Analysis
  Abstract
  Data analysts aim at guaranteeing that the result of a data analysis run on sample data does not differ too much from the result one would achieve by running the analysis over the entire population. To achieve this goal, they have developed several techniques to control the generalization errors of their data analyses. In this talk, I will discuss how programming language techniques can help data analysts to design adaptive data analyses with low generalization error. An adaptive data analysis can be seen as a process composed by multiple queries interrogating some data, where the choice of which query to run next may rely on the results of previous queries. When queries are arbitrarily composed, the different errors can propagate through the chain of different queries and bring high generalization errors. To address this issue, data analysts are designing several techniques that not only guarantee bounds on the generalization errors of single queries, but that also guarantee bounds on the generalization error of the composed analyses. In my talk, I will first present a programming model for adaptive data analyses based on a simple imperative programming language that is suitable to integrate different techniques that can be used for controlling the generalization error. I will then introduce a program analysis for this language that, given an input program implementing an adaptive data analysis, generates an upper bound on the total number of queries that the data analysis will run, and more interestingly also an upper bound on the depth of the chain of queries implemented by the input program. These two measures can be used to select the right technique to guarantee a bound on the generalization error of the input data analysis. I will also discuss how such program analysis could also be potentially extended to higher order functional programs. I will then discuss limitations and potential future works.
  Based on joint work with Jiawen Liu (Boston University), Weihao Qu (Boston University), Deepak Garg (MPI-SWS) and Jonathan Ullmann (Northeastern University).
  
  
• Harald Søndergaard, University of Melbourne (joint PPDP-LOPSTR invited speaker)
  String abstract domains and their combination
  Abstract
  Strings are challenging for static analysis. The perennial problem in static analysis, of finding a good balance between precision and efficiency, is particularly unwieldy for string analysis. For static reasoning about strings, many string facets are of potential relevance, such as length, shape, and the characters used. Hence abstract interpretations of string manipulating programs tend to either employ an expressive but expensive abstract domain, or else combine a number of cheaper domains, each designed to capture a specific aspect of strings. In the presentation I will discuss frameworks for abstract domain combination and survey recent developments in string static analysis.
  
  
• Stephen Wolfram, Wolfram Research (joint PPDP-LOPSTR invited speaker)
  The Computational Structure of the Universe and of Programs
  Abstract
  I'll talk about my emerging new foundational understanding of computation based on three large-scale projects: (1) Our recent Physics Project, which provides a fundamentally computational model for the low-level operation of our universe, (2) My long-time investigation of the typical behavior of simple programs (such as cellular automata, combinators, etc.) in the computational universe and (3) The long-time development of the Wolfram Language as a computational language to describe the world. I'll describe my emerging concept of the multicomputational paradigm---and some of its implications for science, distributed computing, language design and the foundations of computation and mathematics.
  
  
• Bernardo Toninho, Luís Caires, and Frank Pfenning. (10 Year Most Influential Paper Award, PPDP 2011).
  A Decade of Dependent Session Types

Program Committee

• Nick Benton, Facebook, UK (co-chair)
• Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia (co-chair)



• Zena Ariola, University of Oregon, USA
• Małgorzata Biernacka, University of Wroclaw, Poland
• James Cheney, The University of Edinburgh, UK
• Stefania Dumbrava, ENSIIE Paris-Evry, France
• Hugo Herbelin, INRIA, France
• Cosimo Laneve, University of Bologna, Italy
• Pierre Lescanne, ENS de Lyon, France
• Ugo de’Liguoro, University of Torino, Italy
• Francesca A. Lisi, University of Bari, Italy
• Yanhong Annie Liu, Stony Brook University, USA
• Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil
• Yukiyoshi Kameyama, University of Tsukuba, Japan
• Petar Maksimović, Imperial College, London, UK
• Yutaka Nagashima, Yale-NUS College, National University of Singapore, Singapore & University of Innsbruck, Austria
• Aleksandar Nanevski, IMDEA Software Institute, Spain
• Vivek Nigam, Huawei Munich Research Center, Germany & Federal University of Paraíba, Brazil
• Jorge A. Pérez, University of Groningen, The Netherlands
• Sanjiva Prasad, Indian Institute of Technology Delhi, India
• Alexis Saurin, CNRS, Université de Paris & INRIA , France
• Tom Schrijvers, KU Leuven, Belgium
• Paul Tarau, University of North Texas, USA
• Tarmo Uustalu, Reykjavik University, Iceland & Tallinn University of Technology, Estonia

Important Dates

• 18.05.2021 AoE: title and abstract submission (extended)
• 25.05.2021 AoE: paper submission (extended)
• 29.06.2021: rebuttal period (48 hours)
• 09.07.2021: notification
• 23.07.2021: final papers
• 06.09.2021: conference starts

Submission Categories & Guidelines

Submission site: easychair.org/conferences/?conf=ppdp2021

Submission Categories

Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports.

Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability.

Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability.

Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages including references. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability.

Possible topics for an Experience Report include, but are not limited to:

• insights gained from real-world projects using declarative programming
• comparison of declarative programming with conventional programming in the context of an industrial project or a university curriculum
• curricular issues encountered when using declarative programming in education
• real-world constraints that created special challenges for an implementation of a declarative language or for declarative programming in general
• novel use of declarative programming in the classroom
• programming pearl that illustrates a nifty new data structure or programming technique.

Supplementary material may be provided via a link to an extended version of the submission (recommended), or in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study extended versions or any material beyond the respective page limit. Material beyond the page limit will not be included in the final published version.

Format of a submission

For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at https://www.acm.org/publications/proceedings-template. The most recent version at the time of writing is 1.75. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara. Authors should note ACM's statement on author's rights which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy.

Requirements for publication

At least one author of each accepted submission will be expected to attend and present the work at the conference. The pc chair may retract a paper that is not presented. The pc chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline.

Review process

Proceedings

PPDP 2021 Proceedings
Proceedings will be published in the ACM International Conference Proceedings Series under ISBN 978-1-4503-8689-0, and will be available in the ACM Digital Library.

• Publication instructions and templates.
• Please use the latest version of the Primary Article Template - LaTeX (1.78; last update May 25, 2021) to create your article submission.

In Cooperation with