RPLA 2019 - Reversibility in Programming, Languages, and Automata (RPLA)

Reversibility has attracted increasing interest in recent years. Many reversible computation models are natural objects of theoretical computer science. They are studied from different points of view in various areas with strong relations to both theoretical concepts and as formal models for applications. The aim of this workshop is to bring together researchers working on different aspects of reversibility in programming, languages, and automata in order to exchange and develop novel ideas. A deeper and interdisciplinary coverage of this particular area may gain new insights and substantial progress.
Typical, but not exclusive, topics:
Reversible programming languages
Reversible computational models
Reversible concepts such as, e.g., quantum computations, symmetric computations
In all these settings:
Application
Expressive Capacity
Descriptional Complexity
Universality, Self-Reproduction
Decision Problems and their Complexity
Algebraic Properties
Formal Semantics