Photograph Courtesy Wikipedia Article on Louve
New! Proceedings are now available online from Springer.
New! Program now available
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 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.
Topics of interest include:
- 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’17 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the past seventeen PADL symposia.
The 16th of January:
8:50- 9 Opening Remarks
9-10 Invited Talk by Dale Miller. Proof checking and logic programming
10 -10:30 Coffee Break
10:30-12 Answer Set Programming
Joost Vennekens. Lowering the learning curve for declarative programming: a Python API for the IDP system
Christoph Redl. Extending Answer Set Programs with Interpreted Functions as First-class Citizens
Jakob Rath and Christoph Redl. Integrating Answer Set Programming with Object-oriented Languages
14-15:30 Testing and Games:
Jonathan Fowler and Graham Hutton. Failing Faster: Overlapping Patterns for Property-Based Testing
Maciej Bendkowski, Katarzyna Grygiel and Paul Tarau. Boltzmann Samplers for Closed Simply-Typed Lambda Terms (Best Student Paper Award)
Paulo Oliva, Jules Hedges, Viktor Winschel, Philipp Zahn and Evguenia Shprits. Selection Equilibria of Higher-Order Games
15:30 -16 Coffee Break
16-17:30 Applications I and Inference
Geoffrey Mainland. A Domain-Specific Language for Software-Defined Radio
Felix Klock. A Declarative DSL for Customized Rendering of Text-Based Art
Theofrastos Mantadelis and Ricardo Rocha. Using Iterative Deepening for Probabilistic Logic Inference
The 17th of January:
9-10 Applications II
Henrik Nilsson and Guerric Chupin. Funky Grooves: Declarative Programming of Full-Fledged Musical Applications
Stefania Costantini, Giovanni De Gasperis and Giulio Nazzicone. DALI for Cognitive Robotics: Principles and Prototype Implementation
10 -10:30 Coffee Break
10:30-12 Programming languages
Sergio Antoy and Michael Hanus. Eliminating Irrelevant Non-determinism in Functional Logic Programs
Neng-Fa Zhou and Jonathan Fruhman. Canonicalizing High-Level Constructs in Picat (Most Practical Paper Award)
Besik Dundua, Temur Kutsia and Klaus Reisenberger-Hagmayer. An Overview of PrhoLog
12 Closing Remarks