PPDP 2019 - 21th International Symposium on Principles and Practice of Declarative Programming
Topics/Call fo Papers
The 21th International Symposium on Principles and Practice of Declarative Programming will take place 7–9 October 2019 in Porto, Portugal. The symposium will be collocated with Symposium on Formal Methods, FM'19 and a part of the FM Week.
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; 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.
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; 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.
Other CFPs
Last modified: 2019-01-06 20:40:03