Jump to content

International Conference on Rewriting Techniques and Applications: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
No edit summary
Line 7: Line 7:
'''Rewriting Techniques and Applications''' ('''RTA''') is an annual international [[academic conference]] on the topic of [[rewriting]]. It covers all aspects of rewriting, including [[termination proof|termination]], [[equational reasoning]], [[theorem proving]], [[higher-order rewriting]], [[unification (computing)|unification]] and the [[lambda calculus]]. The conference consists of peer-reviewed papers with the proceedings published by [[Springer Science+Business Media|Springer]] in the [[Lecture Notes in Computer Science|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.
'''Rewriting Techniques and Applications''' ('''RTA''') is an annual international [[academic conference]] on the topic of [[rewriting]]. It covers all aspects of rewriting, including [[termination proof|termination]], [[equational reasoning]], [[theorem proving]], [[higher-order rewriting]], [[unification (computing)|unification]] and the [[lambda calculus]]. The conference consists of peer-reviewed papers with the proceedings published by [[Springer Science+Business Media|Springer]] in the [[Lecture Notes in Computer Science|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|Federated Logic Conference (FLoC)]], and [[Rewriting, Deduction, and Programming (RDP)]].
The first RTA was held in [[Dijon]], [[France]] in September 1983. RTA took part in the federated conferences [[Federated Logic Conference|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).

==Further reading==
{{cite book|title=Rewriting Techniques and Applications: 19th International Conference, RTA 2008 Hagenberg, Austria, July 15–17, 2008, Proceedings (Lecture Notes in Computer Science)|author=Andre Voronkov (ed.)|publisher=Springer|date=August 2008|isbn=3-540-70588-0}}


== External links ==
== External links ==
*[http://rewriting.loria.fr/rta/ RTA home page]
*[http://rewriting.org RTA home page]


{{Authority control}}
{{Authority control}}

Revision as of 08:12, 31 August 2021

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 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


This article about a computer conference is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=International_Conference_on_Rewriting_Techniques_and_Applications&oldid=1041571036"