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
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.
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.