International Conference on Rewriting Techniques and Applications
 |
The topic of this article may not meet Wikipedia's general notability guideline. Please help to establish notability by adding reliable, secondary sources about the topic. If notability cannot be established, the article is likely to be merged, redirected, or deleted. (September 2011) |
 |
This article relies largely or entirely upon a single source. Please help improve this article by introducing citations to additional sources. Discussion about the problems with the sole source used may be found on the talk page. (September 2011) |
Rewriting Techniques and Applications (RTA) is an annual international academic conference on the topic of rewriting. It covers all aspects of rewriting, including termination, equational reasoning, theorem proving, higher-order rewriting, unification and the lambda calculus. 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 takes part in the federated conferences Federated Logic Conference (FLoC), and Rewriting, Deduction, and Programming (RDP).
[edit] Further reading
Andre Voronkov (ed.) (August 2008). Rewriting Techniques and Applications: 19th International Conference, RTA 2008 Hagenberg, Austria, July 15–17, 2008, Proceedings (Lecture Notes in Computer Science). Springer. ISBN 3540705880.
[edit] External links
| This article about a computer conference is a stub. You can help Wikipedia by expanding it. |
