Rewriting Techniques and Applications (RTA) is an annual international
academic conference on the topic of
rewriting
In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a well-formed formula, formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewr ...
. It covers all aspects of rewriting, including
termination,
equational reasoning,
theorem proving,
higher-order rewriting,
unification and the
lambda calculus
Lambda calculus (also written as ''λ''-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation ...
. The conference consists of peer-reviewed papers with the proceedings published by
Springer in the
LNCS series until 2009, and since then in the
LIPIcs series published by the Leibniz-Zentrum für Informatik. Several rewriting-related workshops are also affiliated with RTA.
The first RTA was held in
Dijon,
France in September 1983. RTA took part in the federated conferences Federated Logic Conference (FLoC) and
Rewriting, Deduction, and Programming (RDP). In 2016, RTA merged with the International Conference on Typed Lambda Calculi and Applications to form the International Conference on
Formal Structures for Computation and Deduction (FSCD).
External links
Official websiteList of the six FSCD conferences, 2016-2021Rewriting Techniques and ApplicationsInternational Conference on Formal Structures for Computation and Deduction
Theoretical computer science conferences
Logic conferences
{{compu-conference-stub