PADL 2018 - 20th International Symposium on Practical Aspects of Declarative Languages - POPL 2018 (original) (raw)

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.

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 2018 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 2018 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 2018), in Los Angeles, CA, USA.

The program is currently displayed in (GMT-08:00) Tijuana, Baja California.

Use conference time zone: (GMT-08:00) Tijuana, Baja CaliforniaSelect other time zone

The GMT offsets shown reflect the offsets at the moment of the conference.

By setting a time band, the program will dim events that are outside this time window. This is useful for (virtual) conferences with a continuous program (with repeated sessions).
The time band will also limit the events that are included in the personal iCalendar subscription service.

Display full programSpecify a time band

You're viewing the program in a time zone which is different from your device's time zone change time zone

Accepted Papers

Title
An Automated Detection of Inconsistencies in SBVR-based Business Rules using Many-sorted LogicPADLA: Kritika Anand, A: Pavan Kumar Chittimalli, A: Ravindra Naik
A REST-based Development Framework for ASP: Tools and ApplicationPADLA: Gelsomina Catalano, A: Giovanni Laboccetta, A: Kristian Reale, A: Francesco Ricca, A: Pierfrancesco Veltri
Automatic Web Services Composition for PhylotasticPADLA: Thanh Nguyen, A: Tran Cao Son, A: Enrico Pontelli
Exploiting Term Hiding to Reduce Run-time Checking OverheadPADLA: Nataliia Stulova, A: José Morales, A: Manuel Hermenegildo
Hygienic Source-Code Generation Using FunctorsPADLA: Karl Crary
INVITED TALK: ``Safe'' Languages Require Sequential ConsistencyPADLI: Todd Millstein
LoIDE: a a web-based IDE for Logic Programming - Preliminary ReportPADLA: Stefano Germano, A: Francesco Calimeri, A: Eliana Palermiti
Navigating Online Semantic Resources for Entity Set ExpansionPADLA: Weronika T. Adrian, Marco Manna
Optimizing Answer Set Computation via Heuristic-Based DecompositionPADLA: Francesco Calimeri, A: Davide Fuscà, A: Simona Perri, A: Jessica Zangari
Probabilistic Functional Logic ProgrammingPADLA: Sandra Dylus, A: Jan Christiansen, A: Finn Teegen
Rewriting High-Level Spreadsheet Structures into Higher-Order Functional ProgramsPADLA: Florian Biermann, Wensheng Dou, A: Peter Sestoft
Snaarkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in HaskellPADLA: Gordon Stewart, A: Samuel Merten, A: Logan Leland
Three is a crowd: SAT, SMT and CLP on a chessboardPADLA: Sebastian Krings, A: Michael Leuschel, A: Philipp Koerner, A: Stefan Hallerstede, A: Miran Hasanagic

Call for Papers

20th International Symposium on Practical Aspects of Declarative Languages (PADL 2018) https://popl18.sigplan.org/track/PADL-2018-papers

Los Angeles, CA, USA, 8 - 9 January, 2018

Co-located with ACM POPL 2018 (https://popl18.sigplan.org/home)

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.

Important Dates and Submission Guidelines

Abstract submission: September 10, 2017 (Extended) Paper submission: September 15, 2017 (Extended) Notification: October 9, 2017 Camera-ready: October 23, 2017 Symposium: January 8-9, 2018

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

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 2018 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 2018 will appear in the LNCS series of Springer Verlag (<www.springer.com/lncs>).

Two papers accepted for publication at PADL’18 will be nominated for the Most Practical Paper award (one of them as the Student Best Paper). These two papers will be invited to submit an extended version of their contribution to the journal “Theory and Practice of Logic Programming” for rapid publication. The extended version should contain at least 30% new content compared to the published conference paper. The extended paper will undergo an additional review process.

Program Committee

Daan Leijen, Microsoft Research
Daniel Winograd-Cort, University of Pennsylvania
David Van Horn, University of Maryland
Edwin Brady, University of St. Andrews
Enrico Pontelli, New Mexico State University
Erika Abraham, RWTH Aachen University
Esra Erdem, Sabanci University
Francesco Calimeri, University of Calabria
Geoffrey Mainland, Drexel University
Grigore Rosu, University of Illinois at Urbana-Champaign
James Cheney, University of Edinburgh
Jurriaan Hage, Universiteit Utrecht
Karl Crary, Carnegie Mellon University
Konstantin Schekotihin, University of Klagenfurt
Lars Bergstrom, Mozilla Research
Lukasz Ziarek, SUNY Buffalo
Manuel Carro, Technical University of Madrid and UPM and IMDEA Software Institute
Marcello Balduccini, Saint Joseph’s University
Marco Gavanelli, University of Ferrara
Marco Maratea, University of Genova
Martin Gebser, University of Potsdam
Mats Carlsson, SICS
Meera Sridhar, University of North Carolina Charlotte
Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center
Paul Tarau, University of North Texas
Paulo Oliva, Queen Mary University of London
Peter Schüller, Marmara University
Ricardo Rocha, University of Porto
Stefan Woltran, Vienna University of Technology
Stefania Costantini, University of L’Aquila
Wolfgang Faber, University of Huddersfield

Publicity Chair

Marco Manna, University of Calabria, Italy

Program Chairs

Nicola Leone, University of Calabria, Italy
Kevin Hamlen, University of Texas at Dallas, TX, USA

Contacts

For additional information about papers and submissions, please write to the official conference email address, or contact the Program Chairs:

email: padl2018@easychair.org
Nicola Leone University of Calabria, Italy https://www.mat.unical.it/leone/
Kevin Hamlen University of Texas at Dallas, TX, USA http://www.utdallas.edu/~hamlen/

Two out of the accepted papers were nominated for the Best Paper Award, via a secret ballot among the Program Committee members:

Francesco Calimeri, Davide Fuscà, Simona Perri, Jessica Zangari, “Optimizing Answer Set Computation via Heuristic-Based Decomposition” (Most Practical Paper Award)
Sandra Dylus, Jan Christiansen, Finn Teegen, “Probabilistic Functional Logic Programming” (Best Student Paper Award)