↓ Skip to main content

Term Rewriting and Applications

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Formal Verification of Infinite State Systems Using Boolean Methods
  3. Altmetric Badge
    Chapter 2 Solving Partial Order Constraints for LPO Termination
  4. Altmetric Badge
    Chapter 3 Computationally Equivalent Elimination of Conditions
  5. Altmetric Badge
    Chapter 4 On the Correctness of Bubbling
  6. Altmetric Badge
    Chapter 5 Propositional Tree Automata
  7. Altmetric Badge
    Chapter 6 Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
  8. Altmetric Badge
    Chapter 7 Unions of Equational Monadic Theories
  9. Altmetric Badge
    Chapter 8 Modular Church-Rosser Modulo
  10. Altmetric Badge
    Chapter 9 Hierarchical Combination of Intruder Theories
  11. Altmetric Badge
    Chapter 10 Feasible Trace Reconstruction for Rewriting Approximations
  12. Altmetric Badge
    Chapter 11 Rewriting Models of Boolean Programs
  13. Altmetric Badge
    Chapter 12 Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ -Calculus
  14. Altmetric Badge
    Chapter 13 A Terminating and Confluent Linear Lambda Calculus
  15. Altmetric Badge
    Chapter 14 A Lambda-Calculus with Constructors
  16. Altmetric Badge
    Chapter 15 Structural Proof Theory as Rewriting
  17. Altmetric Badge
    Chapter 16 Checking Conservativity of Overloaded Definitions in Higher-Order Logic
  18. Altmetric Badge
    Chapter 17 Certified Higher-Order Recursive Path Ordering
  19. Altmetric Badge
    Chapter 18 Dealing with Non-orientable Equations in Rewriting Induction
  20. Altmetric Badge
    Chapter 19 TPA: Termination Proved Automatically
  21. Altmetric Badge
    Chapter 20 RAPT : A Program Transformation System Based on Term Rewriting
  22. Altmetric Badge
    Chapter 21 The CL-Atse Protocol Analyser
  23. Altmetric Badge
    Chapter 22 Slothrop : Knuth-Bendix Completion with a Modern Termination Checker
  24. Altmetric Badge
    Chapter 23 Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
  25. Altmetric Badge
    Chapter 24 Predictive Labeling
  26. Altmetric Badge
    Chapter 25 Termination of String Rewriting with Matrix Interpretations
  27. Altmetric Badge
    Chapter 26 Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
  28. Altmetric Badge
    Chapter 27 Proving Positive Almost Sure Termination Under Strategies
  29. Altmetric Badge
    Chapter 28 A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
  30. Altmetric Badge
    Chapter 29 Higher-Order Orderings for Normal Rewriting
  31. Altmetric Badge
    Chapter 30 Bounded Second-Order Unification Is NP-Complete
Overall attention for this book and its chapters
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
12 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.
Title
Term Rewriting and Applications
Published by
Springer Berlin Heidelberg, July 2006
DOI 10.1007/11805618
ISBNs
978-3-54-036834-2, 978-3-54-036835-9
Editors

Pfenning, Frank

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Portugal 1 8%
Unknown 11 92%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 33%
Student > Bachelor 2 17%
Professor 2 17%
Other 1 8%
Student > Doctoral Student 1 8%
Other 2 17%
Readers by discipline Count As %
Computer Science 9 75%
Linguistics 1 8%
Business, Management and Accounting 1 8%
Engineering 1 8%