↓ Skip to main content

Rewriting Techniques and Applications

Overview of attention for book
Cover of 'Rewriting Techniques and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Modular Termination of Basic Narrowing
  3. Altmetric Badge
    Chapter 2 Linear-algebraic λ -calculus: higher-order, encodings, and confluence.
  4. Altmetric Badge
    Chapter 3 Term-Graph Rewriting Via Explicit Paths
  5. Altmetric Badge
    Chapter 4 Finer Is Better: Abstraction Refinement for Rewriting Approximations
  6. Altmetric Badge
    Chapter 5 A Needed Rewriting Strategy for Data-Structures with Pointers
  7. Altmetric Badge
    Chapter 6 Effectively Checking the Finite Variant Property
  8. Altmetric Badge
    Chapter 7 Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
  9. Altmetric Badge
    Chapter 8 Maximal Termination
  10. Altmetric Badge
    Chapter 9 Usable Rules for Context-Sensitive Rewrite Systems
  11. Altmetric Badge
    Chapter 10 Combining Equational Tree Automata over AC and ACI Theories
  12. Altmetric Badge
    Chapter 11 Closure of Hedge-Automata Languages by Hedge Rewriting
  13. Altmetric Badge
    Chapter 12 On Normalisation of Infinitary Combinatory Reduction Systems
  14. Altmetric Badge
    Chapter 13 Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
  15. Altmetric Badge
    Chapter 14 Arctic Termination ...Below Zero
  16. Altmetric Badge
    Chapter 15 Logics and Automata for Totally Ordered Trees
  17. Altmetric Badge
    Chapter 16 Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks
  18. Altmetric Badge
    Chapter 17 Nominal Unification from a Higher-Order Perspective
  19. Altmetric Badge
    Chapter 18 Functional-Logic Graph Parser Combinators
  20. Altmetric Badge
    Chapter 19 Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
  21. Altmetric Badge
    Chapter 20 Tree Automata for Non-linear Arithmetic
  22. Altmetric Badge
    Chapter 21 Confluence by Decreasing Diagrams
  23. Altmetric Badge
    Chapter 22 A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
  24. Altmetric Badge
    Chapter 23 Root-Labeling
  25. Altmetric Badge
    Chapter 24 Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
  26. Altmetric Badge
    Chapter 25 Deciding Innermost Loops
  27. Altmetric Badge
    Chapter 26 Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
  28. Altmetric Badge
    Chapter 27 Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
  29. Altmetric Badge
    Chapter 28 Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
  30. Altmetric Badge
    Chapter 29 Reduction Under Substitution
  31. Altmetric Badge
    Chapter 30 Normalization of Infinite Terms
Attention for Chapter 20: Tree Automata for Non-linear Arithmetic
Altmetric Badge

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Tree Automata for Non-linear Arithmetic
Chapter number 20
Book title
Rewriting Techniques and Applications
Published by
Springer, Berlin, Heidelberg, July 2008
DOI 10.1007/978-3-540-70590-1_20
Book ISBNs
978-3-54-070588-8, 978-3-54-070590-1
Authors

Naoki Kobayashi, Hitoshi Ohsaki, Kobayashi, Naoki, Ohsaki, Hitoshi

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 3 100%