## Sophie Tison

*Proceedings of the 13th International Conference on Rewriting Techniques and Applications*

RTA, 2002.

@proceedings{RTA-2002, address = "Copenhagen, Denmark", editor = "Sophie Tison", isbn = "3-540-43916-1", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 13th International Conference on Rewriting Techniques and Applications}", volume = 2378, year = 2002, }

### Contents (29 items)

- RTA-2002-ShankarR
- Combining Shostak Theories (NS, HR), pp. 1–18.
- RTA-2002-Mitchell #analysis #multi #protocol #security
- Multiset Rewriting and Security Protocol Analysis (JCM), pp. 19–22.
- RTA-2002-Baader #logic #representation
- Engineering of Logics for the Content-Based Representation of Information (FB), p. 23.
- RTA-2002-Mellies #axiom #revisited
- Axiomatic Rewriting Theory VI Residual Theory Revisited (PAM), pp. 24–50.
- RTA-2002-KennawayKP #composition #static analysis #λ-calculus
- Static Analysis of Modularity of β-Reduction in the Hyperbalanced λ-Calculus (RK, ZK, AP), pp. 51–65.
- RTA-2002-FaureK #calculus #exception
- Exceptions in the Rewriting Calculus (GF, CK), pp. 66–82.
- RTA-2002-Struth #calculus
- Deriving Focused Lattice Calculi (GS), pp. 83–97.
- RTA-2002-SekiTFK #term rewriting
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (HS, TT, YF, YK), pp. 98–113.
- RTA-2002-OhsakiT #decidability #equation
- Decidability and Closure Properties of Equational Tree Languages (HO, TT), pp. 114–128.
- RTA-2002-RetyV #set
- Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.
- RTA-2002-Waldmann #game studies
- Rewrite Games (JW), pp. 144–158.
- RTA-2002-SeveriV
- An Extensional Böhm Model (PS, FJdV), pp. 159–173.
- RTA-2002-Forest #calculus #pattern matching
- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution (JF), pp. 174–191.
- RTA-2002-LiangN #representation #trade-off
- Tradeoffs in the Intensional Representation of λ Terms (CL, GN), pp. 192–206.
- RTA-2002-DeharbeMR #logic #model checking
- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae (DD, AMM, CR), pp. 207–221.
- RTA-2002-Voigtlander #composition #performance #transducer
- Conditions for Efficiency Improvement by Tree Transducer Composition (JV), pp. 222–236.
- RTA-2002-BravenboerV
- Rewriting Strategies for Instruction Selection (MB, EV), pp. 237–251.
- RTA-2002-BournezK #probability
- Probabilistic Rewrite Strategies. Applications to ELAN (OB, CK), pp. 252–266.
- RTA-2002-Geser #string
- Loops of Superexponential Lengths in One-Rule String Rewriting (AG), pp. 267–280.
- RTA-2002-Tahhan-Bittar #bound #confluence #recursion #term rewriting
- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
- RTA-2002-Lucas #canonical #termination
- Termination of (Canonical) Context-Sensitive Rewriting (SL), pp. 296–310.
- RTA-2002-CharatonikT #constraints #set
- Atomic Set Constraints with Projection (WC, JMT), pp. 311–325.
- RTA-2002-LevyV #higher-order #problem #unification
- Currying Second-Order Unification Problems (JL, MV), pp. 326–339.
- RTA-2002-DoughertyW #decidability #higher-order
- A Decidable Variant of Higher Order Matching (DJD, TW), pp. 340–351.
- RTA-2002-BaaderT
- Combining Decision Procedures for Positive Theories Sharing Constructors (FB, CT), pp. 352–366.
- RTA-2002-Pol #named
- JITty: A Rewriter with Strategy Annotations (JvdP), pp. 367–370.
- RTA-2002-Durand #named #term rewriting
- Autowrite: A Tool for Checking Properties of Term Rewriting Systems (ID), pp. 371–375.
- RTA-2002-LeclandR #implementation #named
- TTSLI: An Implementation of Tree-Tuple Synchronized Languages (BL, PR), pp. 376–379.
- RTA-2002-Lippi #interactive #interpreter #visual notation
- in
^{2}: A Graphical Interpreter for Interaction Nets (SL), pp. 380–386.

3 ×#calculus

3 ×#named

3 ×#term rewriting

2 ×#composition

2 ×#decidability

2 ×#higher-order

2 ×#logic

2 ×#representation

2 ×#set

3 ×#named

3 ×#term rewriting

2 ×#composition

2 ×#decidability

2 ×#higher-order

2 ×#logic

2 ×#representation

2 ×#set