Friday, September 8, 2017

[DMANET] [Reminder] PADL 2018 - abstract deadline approaching

[with apologies for cross-postings]

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

Los Angeles, CA, USA, 8 - 9 January, 2018
Co-located with ACM POPL 2018

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

The two best papers accepted for publication at PADL will be invited to
submit an extended version for rapid publication in the journal Theory and
Practice of Logic Programming.

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

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), each
in cash amount of 250 Euro. 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.

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/

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

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************