[fg-arc] Call for Participation: Practical Aspects of Declarative Languages (PADL) Paris, France, January 16/17, 2017

[Peter Schüller]

Practical Aspects of Declarative Languages (PADL 2017)

16th and 17th January 2017 
Paris, France

Co-located with 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017)

http://popl17.sigplan.org/track/PADL-2017


Program
The 16th of January:

8:50- 9 Opening Remarks

9-10 Invited Talk by Gopal Gupta. Developing Large-scale Knowledge-based Systems with Predicate Answer Set 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

12-14 Lunch

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

(Apologies if you receive multiple copies of this email. Please distribute to interested parties.)