International Conference on Rewriting Techniques and Applications

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

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 3-540-70588-0.CS1 maint: extra text: authors list (link)

gollark: Hmm, I wonder why I have 97 ttys.
gollark: If I plug in a USB serial device, I get a tty in /dev fine.
gollark: ???
gollark: I don't think you need to compile the kernel for serial IO.
gollark: Broadly speaking, you have a parser which turns the text into abstract syntax trees representing the code (`1 + 1` goes to `Operator("+", 1, 1)` or something, for example), then you generate structures for all the various functions and whatever and check things for validity, then turn those into output code.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.