PADL 2019 - 21st International Symposium on Practical Aspects of Declarative Languages
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 concepts, including, functional, logic, constraints, etc.
PADL 2019 will take place on 14-15 January.
Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base 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 novel problems raise numerous interesting research issues. Well-known questions include 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.
Topic of interest for PADL 2019 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 2019 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the past PADL symposia. It will be co-located with the Symposium on Principles of Programming Languages (POPL 2019), in Cascais/Lisbon, Portugal.
Mon 14 JanDisplayed time zone: Belfast change
14:00 - 15:30 | |||
13:50 10mDay opening | PADL Opening and Welcome PADL Moa Johansson Chalmers University of Technology, José Julio Alferes NOVA LINCS -- Universidade Nova de Lisboa | ||
14:00 30mTalk | Natural Language Generation From Ontologies PADL | ||
14:30 30mTalk | Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLP PADL File Attached | ||
15:00 30mTalk | Improving Residuation in Declarative Programs PADL Michael Hanus Kiel University File Attached |
16:00 - 17:30 | |||
16:00 30mTalk | Faster Coroutine Pipelines: A Reconstruction PADL | ||
16:30 30mTalk | Distributed Protocol Combinators PADL Kristoffer Just Arndal Andersen Aarhus University, Ilya Sergey Yale-NUS College and National University of Singapore Pre-print | ||
17:00 30mTalk | Classes of Arbitrary Kind PADL Alejandro Serrano Utrecht University, Netherlands, Victor Cacciari Miraldo Utrecht University, Netherlands Link to publication DOI File Attached |
Tue 15 JanDisplayed time zone: Belfast change
09:00 - 10:30 | |||
09:30 30mTalk | Personalized Course Schedule Planning using Answer Set Programming PADL File Attached | ||
10:00 30mTalk | Static Partitioning of Spreadsheets for Parallel Execution PADL File Attached |
11:00 - 12:30 | |||
11:00 30mTalk | An ASP-based Approach to Representing and Querying Textual Knowledge PADL | ||
11:30 30mTalk | Strong Equivalence and Program's Structure in Arguing Essential Equivalence PADL Yuliya Lierler University of Nebraska | ||
12:00 30mTalk | Automatic Program Rewriting in Non-Ground Answer Set Programs PADL |
14:00 - 15:30 | |||
14:00 30mTalk | Composing Syntactical Constructs to Create Domain-Specific Languages PADL DOI Media Attached | ||
14:30 30mTalk | Proof Carrying Plans PADL Christopher Schwaab University of St Andrews, Ekaterina Komendantskaya Heriot-Watt University, UK, Alasdair Hill , Frantisek Farka , Ron Petrick , Joe Wells , Kevin Hammond University of St. Andrews, UK | ||
15:00 30mTalk | A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers PADL Paul Tarau University of North Texas |
Accepted Papers
Proceedings published by Springer: https://link.springer.com/book/10.1007/978-3-030-05998-9
Call for Papers
21th International Symposium on Practical Aspects of Declarative Languages (PADL 2019) https://popl19.sigplan.org/track/PADL-2019
Lisbon, Portugal. 14 -15 January 2019.
Co-located with ACM POPL 2019 (https://popl19.sigplan.org/home)
Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base 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 novel problems raise numerous interesting research issues. Well-known questions include 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 emphasising novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. 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 2019 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the past PADL symposia. It will be co-located with the Symposium on Principles of Programming Languages (POPL 2019), in Lisbon, Portugal.
Important Dates and Submission Guidelines
Abstracts due: 21 September
Papers due: 28 September
Notification to authors: 26 October
Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system: https://easychair.org/conferences/?conf=padl2019
All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. 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.
PADL 2019 will accept both technical and application papers:
-
Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 pages (plus one page of references) in Springer LNCS format.
-
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. The limit for application papers is 8 pages in Springer LNCS format but such papers can also point to sites with supplemental information about the application or the system that they describe.
The proceedings of PADL 2019 will appear in the LNCS series of Springer Verlag: https://www.springer.com/gp/computer-science/lncs
Journal Publication for Best Papers
The best papers (as selected by the PC chairs) 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), and for papers related to functional programming, in Journal of Functional Programming (JFP).
The authors of these papers will be invited to submit a journal version containing at least 30% new material. This will be reviewed by the PC and/or the respective journal editors for a swifter reviewing process of the journal version.
Such extensions could be 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.