Abstract is missing.
- RTA 2012 Proceedings FrontmatterAshish Tiwari. [doi]
- Computational Real Algebraic Geometry in Practice (Invited Talk)Hirokazu Anai. 1 [doi]
- Rho-Calculi for Computation and Logic (Invited Talk)Claude Kirchner. 2-4 [doi]
- Dictionary-Based Tree Compression (Invited Talk)Sebastian Maneth. 5-5 [doi]
- An Abstract Factorization Theorem for Explicit SubstitutionsBeniamino Accattoli. 6-21 [doi]
- On the Invariance of the Unitary Cost Model for Head ReductionBeniamino Accattoli, Ugo Dal Lago. 22-37 [doi]
- A Term Rewriting System for Kuratowski's Closure-Complement ProblemOsama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge. 38-52 [doi]
- Term Rewriting Systems as Topological Dynamical SystemsSoren Bjerg Andersen, Jakob Grue Simonsen. 53-68 [doi]
- Infinitary Term Graph Rewriting is Simple, Sound and CompletePatrick Bahr. 69-84 [doi]
- Axiomatic Sharing-via-LabellingThibaut Balabonski. 85-100 [doi]
- On the Decidability Status of Reachability and Coverability in Graph Transformation SystemsNathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath. 101-116 [doi]
- Normalisation for Dynamic Pattern CalculiEduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos. 117-132 [doi]
- A Semantic Proof that Reducibility Candidates entail Cut EliminationDenis Cousineau 0002, Olivier Hermant. 133-148 [doi]
- One-context Unification with STG-Compressed Terms is in NPCarles Creus, Adria Gascón, Guillem Godoy. 149-164 [doi]
- Deciding Confluence of Ground Term Rewrite Systems in Cubic TimeBertram Felgenhauer. 165-175 [doi]
- Polynomial Interpretations for Higher-Order RewritingCarsten Fuhs, Cynthia Kop. 176-192 [doi]
- On Soundness Conditions for Unraveling Deterministic Conditional Rewrite SystemsKarl Gmeiner, Bernhard Gramlich, Felix Schernhammer. 193-208 [doi]
- Reinterpreting Compression in Infinitary RewritingJeroen Ketema. 209-224 [doi]
- Finite Models vs Tree Automata in Safety VerificationAlexei Lisitsa. 225-239 [doi]
- Triangulation in RewritingVincent van Oostrom, Hans Zantema. 240-255 [doi]
- Turing-Completeness of Polymorphic Stream Equation SystemsChristian Sattler, Florent Balestrieri. 256-271 [doi]
- Matching of Compressed Patterns with Character-VariablesManfred Schmidt-Schauß. 272-287 [doi]
- Meaningless Sets in Infinitary Combinatory LogicPaula Severi, Fer-Jan de Vries. 288-304 [doi]
- A Rewriting Framework for Activities Subject to RegulationsMax I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic. 305-322 [doi]
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda CalculusKazushige Terui. 323-338 [doi]
- On the Formalization of Termination Techniques based on Multiset OrderingsRené Thiemann, Guillaume Allais, Julian Nagele. 339-354 [doi]