default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th RTA 2002: Copenhagen, Denmark
- Sophie Tison
:
Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings. Lecture Notes in Computer Science 2378, Springer 2002, ISBN 3-540-43916-1
Invited Talks
- Natarajan Shankar, Harald Rueß:
Combining Shostak Theories. 1-18 - John C. Mitchell:
Multiset Rewriting and Security Protocol Analysis. 19-22 - Franz Baader:
Engineering of Logics for the Content-Based Representation of Information. 23
Regular Papers, Application Papers
- Paul-André Melliès:
Axiomatic Rewriting Theory VI Residual Theory Revisited. 24-50 - Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno:
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus. 51-65 - Germain Faure, Claude Kirchner:
Exceptions in the Rewriting Calculus. 66-82 - Georg Struth:
Deriving Focused Lattice Calculi. 83-97 - Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji:
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. 98-113 - Hitoshi Ohsaki, Toshinori Takai:
Decidability and Closure Properties of Equational Tree Languages. 114-128 - Pierre Réty, Julie Vuotto:
Regular Sets of Descendants by Some Rewrite Strategies. 129-143 - Johannes Waldmann:
Rewrite Games. 144-158 - Paula Severi, Fer-Jan de Vries:
An Extensional Böhm Model. 159-173 - Julien Forest:
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution. 174-191 - Chuck C. Liang, Gopalan Nadathur:
Tradeoffs in the Intensional Representation of Lambda Terms. 192-206 - David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen:
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae. 207-221 - Janis Voigtländer:
Conditions for Efficiency Improvement by Tree Transducer Composition. 222-236 - Martin Bravenboer, Eelco Visser:
Rewriting Strategies for Instruction Selection. 237-251 - Olivier Bournez, Claude Kirchner:
Probabilistic Rewrite Strategies. Applications to ELAN. 252-266 - Alfons Geser:
Loops of Superexponential Lengths in One-Rule String Rewriting. 267-280 - Elias Tahhan-Bittar:
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems. 281-295 - Salvador Lucas:
Termination of (Canonical) Context-Sensitive Rewriting. 296-310 - Witold Charatonik, Jean-Marc Talbot:
Atomic Set Constraints with Projection. 311-325 - Jordi Levy, Mateu Villaret:
Currying Second-Order Unification Problems. 326-339 - Daniel J. Dougherty, Tomasz Wierzbicki:
A Decidable Variant of Higher Order Matching. 340-351 - Franz Baader, Cesare Tinelli:
Combining Decision Procedures for Positive Theories Sharing Constructors. 352-366
System Descriptions
- Jaco van de Pol:
JITty: A Rewriter with Strategy Annotations. 367-370 - Irène Durand:
Autowrite: A Tool for Checking Properties of Term Rewriting Systems. 371-375 - Benoit Lecland, Pierre Réty:
TTSLI: An Implementation of Tree-Tuple Synchronized Languages. 376-379 - Sylvain Lippi:
in2 : A Graphical Interpreter for Interaction Nets. 380-386
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-11-15 19:20 CET 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:
