Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online

Available now: Proceedings for PADL 2021

 About

The paradigm of declarative languages encompasses several well-established classes of programming languages, namely: functional, logic, and constraint programming languages.These languages have been successfully applied to many different real-world situations, ranging from database management to active networks to software engineering to decision support systems.

New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to challenging problems raise intriguing research questions, such as scalable design and implementation, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well.

PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. Topics of interest include, but are not limited to:

  • Innovative applications of declarative languages
  • Declarative domain-specific languages and applications
  • Practical applications of theoretical results
  • New language developments and their impact on applications
  • Declarative languages for software engineering
  • Evaluation of implementation techniques on practical applications
  • Practical experiences and industrial applications
  • Novel uses of declarative languages in the classroom
  • Practical languages and extensions such as probabilistic and reactive languages

PADL 2021 especially welcomes new ideas and approaches pertaining to applications, design and implementation of declarative languages going beyond the scope of the past PADL symposia, for example, advanced database languages and contract languages, as well as verification and theorem proving methods that rely on declarative languages.

Dates
Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 18 Jan

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

14:30 - 15:30
Keynote 1PADL at PADL
Chair(s): Dominic Orchard University of Kent, UK
14:30
60m
Keynote
Semantics-based Synthesis in miniKanren
PADL
William E. Byrd University of Alabama at Birmingham, USA
15:30 - 16:00
15:30
30m
Social Event
Topic Oriented Discussions
Workshops and Co-located Events

16:00 - 17:30
Applications of Declarative LanguagesPADL at PADL
Chair(s): Ekaterina Komendantskaya Heriot-Watt University, UK
16:00
30m
Research paper
A Logic Programming Approach to Regression Based Repair of Incorrect Initial Belief States
PADL
Fabio Tardivo New Mexico State University, Loc Pham New Mexico State University, Tran Cao Son New Mexico State University, Enrico Pontelli New Mexico State University
16:30
30m
Research paper
Data validation meets Answer Set Programming
PADL
Mario Alviano University of Calabria, Carmine Dodaro Department of Mathematics and Computer Science, University of Calabria, Arnel Zamayla University of Calabria, Italy
17:00
30m
Research paper
Lightweight Declarative Server-Side Web Programming
PADL
Michael Hanus Kiel University
17:30 - 18:00
17:30
30m
Break
Monday Coffee Break 2
Workshops and Co-located Events

18:00 - 19:30
Foundations and Programming ConceptsPADL at PADL
Chair(s): Dominic Orchard University of Kent, UK
18:00
30m
Research paper
A Family of Unification-oblivious Program Transformations and Their Applications
PADL
Paul Tarau University of North Texas
18:30
30m
Research paper
On Adding Pattern Matching to Haskell-based Deeply Embedded Domain Specific Languages
PADL
David Young University of Kansas, USA, Mark Grebe University of Central Missouri, USA, Andy Gill University of Kansas, USA
19:30 - 20:00
19:30
30m
Social Event
Monday Shuffle-Space Time
Workshops and Co-located Events

Tue 19 Jan

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

14:30 - 15:30
Keynote 2PADL at PADL
Chair(s): José Morales IMDEA Software Institute
14:30
60m
Keynote
SMT-based Constraint Answer Set Solver EZSMT
PADL
Yuliya Lierler University of Nebraska
15:30 - 16:00
15:30
30m
Social Event
Tuesday Shuffle-Space Time
Workshops and Co-located Events

16:00 - 17:30
Declarative Approaches to Testing and DebuggingPADL at PADL
Chair(s): Paul Tarau University of North Texas
16:00
30m
Research paper
ConFuzz: Coverage-guided Property Fuzzing for Event-driven Programs
PADL
Sumit Padhiyar Indian Institue Of Technology, Madras, KC Sivaramakrishnan IIT Madras
Link to publication
16:30
30m
Research paper
Causal-Consistent Reversible Debugging: Improving CauDEr
PADL
Juan José González-Abril MiST, VRAIN, Universitat Politecnica de Valencia, German Vidal Universitat Politecnica de Valencia
17:00
30m
Research paper
Declarative Debugging of XML Queries
PADL
Jesus M. Almendros-Jimenez Universidad de Almeria, Antonio Becerra-Teron University of Almeria
17:30 - 18:00
17:30
30m
Break
Tuesday Coffee Break 2
Workshops and Co-located Events

18:00 - 19:30
Foundations and Programming Concepts at WorkPADL at PADL
Chair(s): Mario Alviano University of Calabria
18:00
30m
Research paper
Synchronous Message-Passing with Priority
PADL
Cheng-En Chuang University at Buffalo, Grant Iraci University at Buffalo, Lukasz Ziarek SUNY Buffalo, USA
18:30
30m
Research paper
Putting gradual types to work
PADL
Bhargav Shivkumar State University of New York - University at Buffalo, Enrique Naudon Bloomberg, Lukasz Ziarek SUNY Buffalo, USA
19:00
30m
Short-paper
Psamathe: A DSL with Flows for Safe Blockchain Assets (extended abstract)
PADL
Reed Oei University of Illinois at Urbana-Champaign, Michael Coblenz University of Maryland at College Park, Jonathan Aldrich Carnegie Mellon University
File Attached
19:30 - 20:00
19:30
30m
Break
Welcome to Copenhagen!
Workshops and Co-located Events

Call for Papers

PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. Topics of interest include, but are not limited to:

  • Innovative applications of declarative languages
  • Declarative domain-specific languages and applications
  • Practical applications of theoretical results
  • New language developments and their impact on applications
  • Declarative languages for software engineering
  • Evaluation of implementation techniques on practical applications
  • Practical experiences and industrial applications
  • Novel uses of declarative languages in the classroom
  • Practical languages and extensions such as probabilistic and reactive languages

PADL 2021 especially welcomes new ideas and approaches pertaining to applications, design and implementation of declarative languages going beyond the scope of the past PADL symposia, for example, advanced database languages and contract languages, computational creativas well as verification and theorem proving methods that rely on declarative languages.

Submissions

PADL solicits three kinds of submission, in Springer LNCS format:

  • Technical papers (max. 15 pages)

Technical papers must describe original, previously unpublished research results.

  • Application papers (max. 8 pages)

Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited.

  • Extended abstracts (max. 3 pages)

Describing new ideas, a new perspective on already published work, or work-in-progress that is not yet ready for a full publication. Extended abstracts will be posted on the symposium website but will not be published in the formal proceedings.

All page limits exclude references. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chair about the place on which it has previously appeared.

Important dates

  • Deadline: 9th October 2020 (AoE)
  • Notification: 6th November 2020
  • Symposium: 18-19th January 2021

Submission is via EasyChair: https://easychair.org/conferences/?conf=padl2021

Distinguished Papers

The authors of a small number of distinguished papers will be invited to submit a longer version for journal publication after the symposium. For papers related to logic programming, in the journal Theory and Practice of Logic Programming (TPLP) https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming, and for papers related to functional programming, in Journal of Functional Programming (JFP) https://www.cambridge.org/core/journals/journal-of-functional-programming. The extended journal submissions should include roughly 30% more context including , for example, explanations for which there was no space, illuminating examples and proofs, additional definitions and theorems, further experimental results, implementational details and feedback from practical/engineering use, extended discussion of related work and such like.

Questions? Use the PADL contact form.