[Caml-list] PPDP'19 Final CFP

[Ekaterina Komendantskaya <komendantskaya@gmail.com>]

[-- Attachment #1: Type: text/plain, Size: 2710 bytes --]

FINAL CALL FOR PAPERS -- PPDP 2019

21st International Symposium on

Principles and Practice of Declarative Programming

7–9 October 2019, Porto, Portugal

Collocated with FM'19

http://ppdp2019.macs.hw.ac.uk

======================================================================

Important Dates

---------------

Title and abstract registration 26 April 2019 (AoE)

Paper submission 3 May 2019 (AoE)

Rebuttal period (48 hours) 3 June 2019 (AoE)

Author notification 14 June 2019

Final paper version 15 July 2019

Conference 7–9 October 2019

About PPDP

----------

The PPDP 2019 symposium brings together researchers from the declarative

programming communities, including those working in the functional, logic,

answer-set, and constraint handling programming paradigms. The goal is to

stimulate research in the use of logical formalisms and methods for
analyzing,

performing, specifying, and reasoning about computations, including
mechanisms

for concurrency, security, static analysis, and verification.


Invited Speakers

----------------

Amal Ahmed Northeastern University, USA

Title: TBA

Naoki Kobayashi The University of Tokyo, Japan

Title: 10 Years of the Higher-Order Model Checking Project

Scope

-----

Submissions are invited on all topics related to declarative programming,
from

principles to practice, from foundations to applications. Topics of
interest

include, but are not limited to

- Language Design: domain-specific languages; interoperability;
concurrency,

parallelism and distribution; modules; probabilistic languages; functional

languages; reactive languages; database languages; knowledge representation

languages; languages with objects; language extensions for tabulation;
metaprogramming.

- Implementations: abstract machines; interpreters; compilation;
compile-time

and run-time optimization; memory management.

- Foundations: types; logical frameworks; monads and effects; semantics.

- Analysis and Transformation: partial evaluation; abstract interpretation;

control flow; data flow; information flow; termination analysis; resource

analysis; type inference and type checking; verification; validation;

debugging; testing.

- Tools and Applications: programming and proof environments; verification

tools; case studies in proof assistants or interactive theorem provers;

certification; novel applications of declarative programming inside and

outside of CS; declarative programming pearls; practical experience reports

and industrial application; education.

For further information, please visit:

http://ppdp2019.macs.hw.ac.uk

[-- Attachment #2: Type: text/html, Size: 20183 bytes --]