PADL 2025: The 27th International Symposium on Practical Aspects of Declarative Languages
Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already 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 fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, 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.
Student grants
PADL 2025 encourages students to participate in the symposium by providing some student grants to partially cover the registration and travel costs. You can apply by filling out the following form before December 25:
https://forms.gle/Xr4HfxgNRxUAy7jv9
The selection process will give preference to students who present their papers at the symposium. Students from underrepresented groups are strongly encouraged to apply.
Venue
PADL 2025 will take place at the Curtis Hotel Denver, 1405 Curtis Street, 80202 Denver, Colorado, United States.
Sponsoring Institutions:
Invited Talks
This program is tentative and subject to change.
Mon 20 JanDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:30 | |||
09:00 60mKeynote | Solvers, unite! A simple unified semantics for reasoning with assurance and agreement PADL Y. Annie Liu Stony Brook University | ||
10:00 30mTalk | Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination PADL |
11:00 - 12:30 | |||
11:00 30mTalk | Type-Checking Heterogeneous Sequences in a Simple Embeddable Type System PADL Jim Newton EPITA / LRDE https://www.lre.epita.fr | ||
11:30 30mTalk | Haskell Based Spreadsheets PADL Ignacio Ballesteros IMDEA Software Institute and Universidad Politécnica de Madrid, Luis Eduardo Bueso de Barrio Universidad Politécnica de Madrid, Julio Mariño Universidad Politécnica de Madrid | ||
12:00 30mTalk | The Scenic Route to Deforestation PADL |
14:00 - 15:30 | |||
14:00 30mTalk | A practical approach to handling tabular data in logic PADL | ||
14:30 30mTalk | C3G: Causally Constrained Counterfactual Generation PADL Sopam Dasgupta , Farhad Shakerin Microsoft, Joaquín Arias Universidad Rey Juan Carlos, Elmer Salazar The University of Texas at Dallas, Gopal Gupta | ||
15:00 30mTalk | On Bridging Prolog and Python to Enhance an Inductive Logic Programming System PADL |
16:00 - 17:30 | |||
16:00 30mTalk | MOLA: A Runtime Verification Engine Factory by (Meta-)interpreting Embedded DSLs PADL Felipe Gorostiaga IMDEA Software Institute, Martin Ceresa IMDEA Software Institute, César Sánchez IMDEA Software Institute | ||
16:30 30mTalk | Checking Concurrency Coding Rules PADL Lars-Åke Fredlund Universidad Politécnica de Madrid, Ángel Herranz Universidad Politécnica de Madrid, Julio Mariño Universidad Politécnica de Madrid |
Tue 21 JanDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:30 | |||
09:00 60mKeynote | Bridging Safety and Performance PADL Umut A. Acar Carnegie Mellon University | ||
10:00 30mTalk | SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic PADL |
11:00 - 12:30 | |||
11:00 30mTalk | ASP for Language Documentation and Reclamation: A Derivational Stemming Tool for Myaamia PADL Daniela Inclezan Miami University, USA, Hunter Lockwood Myaamia Center & Miami University, Anita Baral Miami University, Jitendra Sharma Miami University, Pratiksha Shrestha Miami University | ||
11:30 30mTalk | A Weighted Bipolar Argumentation Framework and its ASP-based Implementation PADL Yan Yan Southeast University, Nanjing, Junru Li Southeast University, Nanjing, Fangzhou Liu Southeast University, Nanjing, Zerong Wang Southeast University, Nanjing, Zhizheng Zhang Southeast University, Nanjing | ||
12:00 30mTalk | Automated Playing of Survival Video Games with Commonsense Reasoning (short paper) PADL Dan Nguyen University of Texas at Dallas, USA, Bryant Hargreaves University of Texas at Dallas, USA, Keegan Kimbrell University of Texas at Dallas, USA, Gopal Gupta |
14:00 - 15:30 | |||
14:00 30mTalk | Exploring Answer Set Programming for Provenance Graph-Based Cyber Threat Detection: A Novel Approach PADL | ||
14:30 30mTalk | Leveraging LLM Reasoning with Dual Horn Programs PADL Paul Tarau University of North Texas | ||
15:00 30mTalk | Enhancing network diagnosis with reflection in Prolog (extended abstract) PADL Anduo Wang Temple University, USA Pre-print |
Accepted Papers
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, databases 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 and software engineering
- Evaluation of implementation techniques on practical applications
- Practical experiences and industrial applications
- Novel uses of declarative languages in the classroom
- Practical extensions such as constraint-based, probabilistic, and reactive languages
PADL 2025 especially welcomes new ideas and approaches related 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.
PADL 2025 encourages students to participate in the symposium by providing some student grants to partially cover the registration and travel costs. The selection process will give preference to students who present their paper in the symposium. Students from underrepresented groups are strongly encouraged to apply.
Submissions
PADL 2025 welcomes regular papers (max. 15 pages, excluding references) and short papers (max. 8 pages, excluding references) that describe original and previously unpublished research results on
- complex and/or real-world applications in industry or in other areas of research, that rely on an innovative use of declarative languages,
- tools and/or systems developed for such applications, and/or to improve practical aspects of declarative languages,
- technical results related to the practical aspects of declarative languages.
Application and systems descriptions, engineering solutions, and real-world experiences (both positive and negative) are in particular solicited. Regular and short papers will be published in the formal proceedings.
PADL 2025 also welcomes extended abstracts (max. 3 pages) on the topics above, that describe 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. Submissions must be written in English and formatted according to the standard Springer LNCS style, see https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
The review process of PADL 2025 is double-anonymous. In your submission, please, omit your names and institutions; refer to your prior work in the third person, just as you refer to prior work by others; do not include acknowledgments that might identify you.
Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them.
Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their reports. So, for LaTeX, we recommend that authors use:
\pagestyle{plain}
\usepackage{lineno}
\linenumbers
The conference proceedings of PADL 2025 will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Work that already appeared in unpublished or informally published Workshop proceedings may be submitted but the authors should notify the program chairs where it has previously appeared. Previous PADL proceedings can be found on SpringerLink.
Papers should be submitted electronically via EquinOCS (registration is required if you do not have an account).
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, that will be in the journal Theory and Practice of Logic Programming (TPLP), and for papers related to functional programming, in Journal of Functional Programming (JFP). The extended journal submissions should be substantially (roughly 30%) extended: 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 so on. These submissions will then be subject to the usual peer review process by the journal, although with the aim of a swifter review process by reusing original reviews from PADL.
Registration for PADL 2025
The registration for PADL 2025 is handled separately from POPL. Please note that at least one author of each accepted paper must register specifically to PADL.
Early registration deadline is December 29, 2024.
Registration Rates for PADL 2025
The registration rates are as follows:
Type of Registration | Early Rate (British pounds) | Regular Rate (British pounds) | |
---|---|---|---|
Student | £310 | £335 | |
Regular | £420 | £500 |
Registration rate includes the cost of venue, lunch, morning and afternoon coffee breaks.
Steps for Registering
You can wire a bank transfer to the following account number (transfer charges assumed by the payer):
- Bank: Natwest (UK)
- Bank address: NatWest Markets Plc is 36 St Andrew Square, Edinburgh, EH2 2YB
- Account name: THE ASSOCIATION FOR LOGIC PROGRAMMING Ltd
- Account holders address: The Association for Logic Programming, Care of Marina De Vos, Dept Computer Science, University of Bath, BA2 7AY
- Sort Code: 60-02-05
- Account Number: 66462738
- BIC: NWBKGB2L
- IBAN: GB74NWBK60020566462738
Transfers usually take a week to complete. Contact Marina De Vos if you have any payment queries.
Once the bank transfer has been made, send a copy of the receipt along with your first name, last name, affiliation, and country to gvidal@dsic.upv.es (Cc: cssmdv@bath.ac.uk).