Tuesday, June 7, 2011

[DMANET] RTA'11 Proceedings published open access (LIPIcs,Vol.10)

= Book Announcement =

Title: Proceedings of RTA'11 (22nd International Conference on Rewriting
Techniques and Applications)
Editors: Manfred Schmidt-Schauss
Series: LIPIcs (Leibniz International Proceedings in Informatics)
Volume: 10
Publisher: Schloss Dagstuhl
ISBN: 978-3-939897-30-9

== Access ==

Open access (online & free of charge) at

http://www.dagstuhl.de/dagpub/978-3-939897-30-9

You may also check the DBLP page at

http://dblp.uni-trier.de/db/conf/rta/rta2011.html

== About the proceedings ==

This volume contains the papers presented at the 22nd International Conference
on Rewriting Techniques and Applications (RTA 2011) which was held from May 30
to June 1, 2011, in Novi Sad, Serbia as part of the RDP 2011 Federated
Conference on Rewriting, Deduction, and Programming, together with the 10th
Typed Lambda Calculi and Applications (TLCA 2011).
RTA is the major forum for the presentation of research on all aspects of
rewriting. For RTA 2011, 20 regular research papers and eight system
descriptions were accepted out of 46 submissions. The Program Committee gave the
award for the Best Contribution to RTA 2011 to Aaron Stump, Garrin Kimmell and
Roba El-Haj Omar for their paper "Type Preservation as a Confluence Problem"
(http://dx.doi.org/10.4230/LIPIcs.RTA.2011.345). In addition to the contributed
papers, the RTA program contained an invited talk by Sophie Tison with title
"Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?", by
Ashish Tiwari on "Rewriting in Practice", and also the common invited talk of
RDP, given by Stephanie Weirich on "Combining Proofs and Programs".

See also:
* Table of Contents/Preface: http://dx.doi.org/10.4230/LIPIcs.RTA.2011.i
* Proceedings webpage: http://www.dagstuhl.de/dagpub/978-3-939897-30-9
* Conference webpage: http://www.rdp2011.uns.ac.rs/rta/

== About the RTA conference ==

RTA is the major conference on rewriting and covers all aspects related to
rewriting such as termination, equational reasoning, theorem proving, Lambda
calculus, higher-order rewriting, unification, verification, constraints, and
software tools.

See also:
* http://rewriting.loria.fr/rta/

== About the LIPIcs series ==

"LIPIcs: Leibniz International Proceedings in Informatics" is a series
of high-quality conference proceedings across all fields in informatics
established in cooperation with "Schloss Dagstuhl--Leibniz Center of
Informatics". LIPIcs volumes are published according to the principle
of OpenAccess, i.e., they are available online and free of charge. The copyright
is retained by the authors.

See also:
* http://www.dagstuhl.de/lipics

--
Marc Herbstritt
Schloss Dagstuhl - Leibniz Center for Informatics
\\\/ Dagstuhl Publishing | LIPIcs Editorial Office
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/lipics
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************