Proceedings
The PPDP 2022 proceedings, ISBN 978-1-4503-9703-2, are published in the ACM Digital Library within the ACM International Conference Proceedings Series.
The International Symposium on Principles and Practice of Declarative Programming (PPDP) aims to provide a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint, and functional programming paradigms, but also also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages, and knowledge representation languages used, for example, in the semantic web.
The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited.
Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to
Language Design: domain-specific languages; interoperability; concurrency, parallelism and distribution; modules; functional languages; logic languages; constraint languages; database languages; reactive languages; languages with objects; languages for quantum computing; languages inspired by biological and chemical computation; metaprogramming.
Declarative languages in artificial intelligence: knowledge representation languages; probabilistic languages; differentiable languages.
Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management.
Foundations: types; logical frameworks; monads and effects; semantics.
Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing.
Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education.
The PC chairs will be happy to advise on the appropriateness of a topic.
PPDP 2022 will be held in Tbilisi, Georgia. Previous symposia were held at Tallin (Estonia), Bologna (Italy), Porto (Portugal), Frankfurt am Main (Germany), Namur (Belgium), Edinburgh (UK), Siena (Italy), Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montréal (Canada), and Paris (France).
To register please use the CLAS registration form on EasyChair. Early registration deadline August 14, 2022. An online-only registration option is available.
Note: authors of papers please note that the organizers of CLAS require, in order to support the fixed conference costs, that at least one author of each accepted paper be registered at the full registration fee, independently of whether they will attend attend on-line or in person.
Times in the schedule are GET (Georgia Standard Time), i.e., local to Tbilisi.
| Tuesday 20 September 2022 | |
|---|---|
| 09:00 - 09:05 | Opening for PPDP Beniamino Accattoli and Manuel Hermenegildo |
| Session 1 | |
| 09:05 - 10:30 | Invited talk: Torsten Grust
Functional Programming Close to the Data (Talk slides) |
| 10:30 - 11:00 | Coffee Break |
| Session 2. Chair: Michael Hanus | |
| 11:00 - 11:30 |
ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri and Jessica Zangari |
| 11:30 - 12:00 |
User Guided Abductive Proof Generation for Answer Set Programming Queries Avishkar Mahajan, Martin Strecker and Meng Wong |
| 12:00 - 12:30 |
A Predicate Construct for Declarative Programming
in Imperative Languages James Smith, Xiangyu Guo and Ajay Bansal |
| 12:30 - 14:00 | Lunch Break |
| Session 3. Chair: Niki Vazou | |
| 14:00 - 15:30 |
10-Year Most Influential Paper Talk Ornela Dardha, Elena Giachino, Davide Sangiorgi Session Types Revisited: A Decade Later |
| 15:30 - 16:00 | Coffee Break |
| Session 4. Chair: Beniamino Accattoli | |
| 16:00 - 16:30 |
A Monadic Implementation of Functional Logic Programs Kai-Oliver Prott, Finn Teegen and Michael Hanus |
| 16:30 - 17:00 |
A Typed Lambda Calculus with Gradual Intersection Types Pedro Ângelo and Mário Florido |
| 17:00 - 17:30 |
A Logic for Formalizing Properties of LF Specifications Gopalan Nadathur and Mary Southern |
| Wednesday 21 September 2022 | |
|---|---|
| Session 5. Chair: Alicia Villanueva | |
| 09:00 - 10:30 |
Invited talk (joint with LOPSTR): Florian
Zuleger
Automated Termination and Complexity Analysis |
| 10:30 - 17:30 | CLAS social events |
| Thursday 22 September 2022 | |
|---|---|
| Session 6. Chair: Beniamino Accattoli | |
| 09:00 - 10:30 |
Invited talk (joint with LOPSTR): Niki Vazou Refinement Types from Light to Deep Verification |
| 10:30 - 11:00 | Coffee Break |
| Session 7. Chair: Ekaterina Komendantskaya | |
| 11:00 - 11:30 |
A Faithful Description of ECMAScript Algorithms Adam Khayam, Louis Noizet and Alan Schmitt |
| 11:30 - 12:00 |
Certified Derivation of Small-Step From Big-Step Skeletal Semantics Guillaume Ambal, Sergueï Lenglet, Alan Schmitt and Camille Noûs |
| 12:00 - 12:30 |
Nominal Matching Logic James Cheney and Maribel Fernandez |
| 12:30 - 14:00 | Lunch Break |
| Session 8. Chair: Pedro Ângelo | |
| 14:00 - 14:30 |
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus David Sabel, Manfred Schmidt-Schauss and Luca Maio |
| 14:30 - 15:00 |
CheckINN: Wide Range Neural Network Verification in Imandra Remi Desmartin, Grant Passmore, Ekaterina Komendantskaya and Matthew Daggit |
| 15:00 - 15:05 | Closing of PPDP |
| Steering Committee Chair: | James Cheney, The University of Edinburgh, UK |
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 sigconf style, 2-column (including figures, but excluding bibliography). See below for further formatting instructions. 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.
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.
For each paper category, you must follow the instructions of the new ACM Primary Article Templates. 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, please 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. Final publication will follow the new ACM Primary Article TAPS Publication Workflow.
The PPDP 2022 proceedings, ISBN 978-1-4503-9703-2, are published in the ACM Digital Library within the ACM International Conference Proceedings Series.
with
and
