default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd RTA 2012: Nagoya, Japan
- Ashish Tiwari:
23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan. LIPIcs 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-38-5 - Ashish Tiwari:
RTA 2012 Proceedings Frontmatter. i-xiii - Hirokazu Anai:
Computational Real Algebraic Geometry in Practice (Invited Talk). 1 - Claude Kirchner:
Rho-Calculi for Computation and Logic (Invited Talk). 2-4 - Sebastian Maneth:
Dictionary-Based Tree Compression (Invited Talk). 5-5 - Beniamino Accattoli:
An Abstract Factorization Theorem for Explicit Substitutions. 6-21 - Beniamino Accattoli, Ugo Dal Lago
:
On the Invariance of the Unitary Cost Model for Head Reduction. 22-37 - Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge:
A Term Rewriting System for Kuratowski's Closure-Complement Problem. 38-52 - Soren Bjerg Andersen, Jakob Grue Simonsen:
Term Rewriting Systems as Topological Dynamical Systems. 53-68 - Patrick Bahr:
Infinitary Term Graph Rewriting is Simple, Sound and Complete. 69-84 - Thibaut Balabonski:
Axiomatic Sharing-via-Labelling. 85-100 - Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath:
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. 101-116 - Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
Normalisation for Dynamic Pattern Calculi. 117-132 - Denis Cousineau, Olivier Hermant:
A Semantic Proof that Reducibility Candidates entail Cut Elimination. 133-148 - Carles Creus, Adrià Gascón, Guillem Godoy:
One-context Unification with STG-Compressed Terms is in NP. 149-164 - Bertram Felgenhauer:
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time. 165-175 - Carsten Fuhs, Cynthia Kop:
Polynomial Interpretations for Higher-Order Rewriting. 176-192 - Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer:
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. 193-208 - Jeroen Ketema:
Reinterpreting Compression in Infinitary Rewriting. 209-224 - Alexei Lisitsa:
Finite Models vs Tree Automata in Safety Verification. 225-239 - Vincent van Oostrom, Hans Zantema:
Triangulation in Rewriting. 240-255 - Christian Sattler, Florent Balestrieri:
Turing-Completeness of Polymorphic Stream Equation Systems. 256-271 - Manfred Schmidt-Schauß:
Matching of Compressed Patterns with Character-Variables. 272-287 - Paula Severi, Fer-Jan de Vries:
Meaningless Sets in Infinitary Combinatory Logic. 288-304 - Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A Rewriting Framework for Activities Subject to Regulations. 305-322 - Kazushige Terui:
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus. 323-338 - René Thiemann, Guillaume Allais, Julian Nagele:
On the Formalization of Termination Techniques based on Multiset Orderings. 339-354
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-28 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
