International Conference on Rewriting Techniques and Applications
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Find sources: "International Conference on Rewriting Techniques and Applications" – news · newspapers · books · scholar · JSTOR Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|International Conference on Rewriting Techniques and Applications|concern=no sources to indicate this conference meets the notability requirements of [[WP:N]]}} ~~~~Timestamp: 20081013032911 03:29, 13 October 2008 (UTC) Administrators: delete |
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. Several rewriting-related workshops are also affiliated with RTA.
The first RTA was held in Dijon, France in September 1983. The seventeenth and most recent RTA was a subconference of IJCAR, which was itself merged with the Federated Logic Conference in Seattle, USA in August 2006.
External links
 | This computing article is a stub. You can help Wikipedia by expanding it. |