Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
2010 (conf/rta/2010)

1. 
   Preface. [Citation Graph (, )][DBLP]
   
   
2. 
   Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). [Citation Graph (, )][DBLP]
   
   
3. 
   Automata for Data Words and Data Trees. [Citation Graph (, )][DBLP]
   
   
4. 
   Realising Optimal Sharing. [Citation Graph (, )][DBLP]
   
   
5. 
   Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling. [Citation Graph (, )][DBLP]
   
   
6. 
   Higher-Order (Non-)Modularity . [Citation Graph (, )][DBLP]
   
   
7. 
   Closing the Gap Between Runtime Complexity and Polytime Computability. [Citation Graph (, )][DBLP]
   
   
8. 
   Abstract Models of Transfinite Reductions. [Citation Graph (, )][DBLP]
   
   
9. 
   Partial Order Infinitary Term Rewriting and Böhm Trees. [Citation Graph (, )][DBLP]
   
   
10. 
    Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. [Citation Graph (, )][DBLP]
    
    
11. 
    The Undecidability of Type Related Problems in Type-free Style System F. [Citation Graph (, )][DBLP]
    
    
12. 
    On (Un)Soundness of Unravelings. [Citation Graph (, )][DBLP]
    
    
13. 
    A Proof Calculus Which Reduces Syntactic Bureaucracy. [Citation Graph (, )][DBLP]
    
    
14. 
    A Rewriting Logic Semantics Approach to Modular Program Analysis. [Citation Graph (, )][DBLP]
    
    
15. 
    Infinitary Rewriting: Foundations Revisited. [Citation Graph (, )][DBLP]
    
    
16. 
    Underspecified computation of normal forms. [Citation Graph (, )][DBLP]
    
    
17. 
    Order-Sorted Unification with Regular Expression Sorts. [Citation Graph (, )][DBLP]
    
    
18. 
    An Efficient Nominal Unification Algorithm. [Citation Graph (, )][DBLP]
    
    
19. 
    Computing Critical Pairs in 2-Dimensional Rewriting Systems. [Citation Graph (, )][DBLP]
    
    
20. 
    Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. [Citation Graph (, )][DBLP]
    
    
21. 
    Automated Termination Analysis of Java Bytecode by Term Rewriting. [Citation Graph (, )][DBLP]
    
    
22. 
    Declarative Debugging of Missing Answers for Maude. [Citation Graph (, )][DBLP]
    
    
23. 
    Simulation in the Call-by-Need Lambda-Calculus with letrec. [Citation Graph (, )][DBLP]
    
    
24. 
    Weak Convergence and Uniform Normalization in Infinitary Rewriting. [Citation Graph (, )][DBLP]
    
    
25. 
    Certified Subterm Criterion and Certified Usable Rules. [Citation Graph (, )][DBLP]
    
    
26. 
    Termination of linear bounded term rewriting systems. [Citation Graph (, )][DBLP]
    
    
27. 
    Polynomially Bounded Matrix Interpretations. [Citation Graph (, )][DBLP]
    
    
28. 
    Optimizing mkbTT. [Citation Graph (, )][DBLP]
    
    
29. 
    Modular Complexity Analysis via Relative Complexity. [Citation Graph (, )][DBLP]
    
    
30. 
    Proving Productivity in Infinite Data Structures. [Citation Graph (, )][DBLP]