Conference Description

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'15 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the past sixteen PADL symposia

Invited Speakers

• Martin Erwig, Oregon State University
• Jan Kuper, University of Twente
  

Conference Program

Thursday, June 18th
Time	Event	Speaker
8:15-9:00	Continental Breakfast
9:00-9:15	Welcome and Introduction	Son Tran and Enrico Pontelli New Mexico State University
9:15-10:00	Invited Speaker: The Choice Calculus and Its Applications	Martin Erwig Oregon State University
10:00-11:00	Session I: Applications I
10:00-10:30	Programming Microcontrollers in Ocaml: the OCaPIC Project	B. Vaugon, P. Wang, E. Chailloux
10:30-11:00	Ontology-Driven Data Semantics Discovery for Cyber-Security	M. Balduccini, S. Kushner, J. Speck
11:00-11:20	Coffee Break
11:20-12:30	Pleanary Speaker	Katherine Yelick University of California at Berkeley
12:30-14:00	Lunch
14:00-15:30	Session II: Implementations
14:00-14:30	On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities	F. Cruz, R. Rocha
14:30-15:00	CHR(Curry): Interpretatoin and Compilation of Constraint Handling Rules in Curry	M. Hanus
15:00-15:30	On Logic Programming representations of lambda terms: de Bruijn indices, compression, type inference, combinatorial generation, normalization	P. Tarau
15:30-16:00	Coffee Break
16:00-17:00	Session III: Applications II
16:00-16:30	Reactive Single-Page Applications with Dynamic Dataflow	S. Fowler, L. Denuziere, A. Granicz
16:30-17:00	Declaratively Solving Google Code Jam Problems with Picat	S. Dymchenko, M. Mykhailova
Friday, June 19th
8:15-9:00	Continental Breakfast
9:00-9:30	Invited Speaker Executable Mathematics	Jan Kuper, University of Twente
9:30-11:00	Session IV: Applications III
9:30-10:00	A Haskell Implementation of a Rule-Based Program Transformation for C Programs	S. Tamarit, G. Vigueras, M. Carro, J. Marino
10:00-10:30	State Space Planning Using Transaction Logic	R. Basseda
10:30-11:00	Implementation and Performance of Probabilistic Inference Pipelines	D. Shterionov and G. Janssens
11:00-11:20	Coffee Break
11:30-12:30	Plenary Speaker	Balaji Prabhakar Stanford University

Important Dates and Registration

Submission Guidelines

The proceedings of PADL'15 will be published as a volume of Springer's LNCS series.

ACCESS to Proceedings: http://link.springer.com/book/10.1007%2F978-3-319-19686-2

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=padl2015

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.

Each submission must include on its first page the paper title; authors, affiliations and contact emails; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper.

PADL 2015 will accept both technical and application papers.

Technical 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

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 will be published in the Springer Verlag conference proceedings, and will be presented in a separate session. 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.

Program Committee

Contacts

For additional information about papers and submissions, please contact the Program Chairs:

Enrico Pontelli and Son Cao Tran
PC co-Chairs - PADL 2015
Department of Computer Science
New Mexico State University
Email: epontell | tson <AT> cs.nmsu.edu

Sponsored by

Association for Logic Programming	University of Texas at Dallas	SIGPLAN