↓ Skip to main content

Conditional and Typed Rewriting Systems

Overview of attention for book
Cover of 'Conditional and Typed Rewriting Systems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 77 Conditional rewriting in focus
  3. Altmetric Badge
    Chapter 78 A maximal-literal unit strategy for horn clauses
  4. Altmetric Badge
    Chapter 79 Extended term rewriting systems
  5. Altmetric Badge
    Chapter 80 A proof system for conditional algebraic specifications
  6. Altmetric Badge
    Chapter 81 Conditional rewriting logic: Deduction, models and concurrency
  7. Altmetric Badge
    Chapter 82 Equivalences of rewrite programs
  8. Altmetric Badge
    Chapter 83 On finite representations of infinite sequences of terms
  9. Altmetric Badge
    Chapter 84 Infinite terms and infinite rewritings
  10. Altmetric Badge
    Chapter 85 Testing confluence of nonterminating rewriting systems
  11. Altmetric Badge
    Chapter 86 A survey of ordinal interpretations of type ɛ 0 for termination of rewriting systems
  12. Altmetric Badge
    Chapter 87 Meta-rule synthesis from crossed rewrite systems
  13. Altmetric Badge
    Chapter 88 An application of automated equational reasoning to many-valued logic
  14. Altmetric Badge
    Chapter 89 Completion of first-order clauses with equality by strict superposition
  15. Altmetric Badge
    Chapter 90 Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
  16. Altmetric Badge
    Chapter 91 Proof by consistency in conditional equational theories
  17. Altmetric Badge
    Chapter 92 Completion procedures as semidecision procedures
  18. Altmetric Badge
    Chapter 93 Errata corrige
  19. Altmetric Badge
    Chapter 94 Linear completion
  20. Altmetric Badge
    Chapter 95 Clausal rewriting
  21. Altmetric Badge
    Chapter 96 Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved
  22. Altmetric Badge
    Chapter 97 On sufficient completeness of conditional specifications
  23. Altmetric Badge
    Chapter 98 FPL : Functional plus logic programming an integration of the FP and Prolog languages
  24. Altmetric Badge
    Chapter 99 Confluence of the disjoint union of conditional term rewriting systems
  25. Altmetric Badge
    Chapter 100 Implementing term rewriting by graph reduction: Termination of combined systems
  26. Altmetric Badge
    Chapter 101 Compiling concurrent rewriting onto the Rewrite Rule Machine
  27. Altmetric Badge
    Chapter 102 Design strategies for rewrite rules
  28. Altmetric Badge
    Chapter 103 A simplifier for untyped lambda expressions
  29. Altmetric Badge
    Chapter 104 Parallel graph rewriting on loosely coupled machine architectures
  30. Altmetric Badge
    Chapter 105 Typed equivalence, type assignment, and type containment
  31. Altmetric Badge
    Chapter 106 A fixed-point semantics for feature type systems
  32. Altmetric Badge
    Chapter 107 Unique-sort order-sorted theories : A description as monad morphisms
  33. Altmetric Badge
    Chapter 108 Equational logics (birkhoff's method revisited)
  34. Altmetric Badge
    Chapter 109 Compatibility of order-sorted rewrite rules
  35. Altmetric Badge
    Chapter 110 An universal termination condition for solving goals in equational languages
  36. Altmetric Badge
    Chapter 111 Constrained equational deduction
  37. Altmetric Badge
    Chapter 112 Higher-order unification, polymorphism, and subsorts
  38. Altmetric Badge
    Chapter 113 Second-order unification in the presence of linear shallow algebraic equations
  39. Altmetric Badge
    Chapter 114 An inference system for horn clause logic with equality
Attention for Chapter 98: FPL : Functional plus logic programming an integration of the FP and Prolog languages
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions
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
FPL : Functional plus logic programming an integration of the FP and Prolog languages
Chapter number 98
Book title
Conditional and Typed Rewriting Systems
Published in
Lecture notes in computer science, June 1990
DOI 10.1007/3-540-54317-1_98
Book ISBNs
978-3-54-054317-6, 978-3-54-047558-3
Authors

N. Lichtenstein, S. Kaplan

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 08 February 2014.
All research outputs
#18,363,356
of 22,743,667 outputs
Outputs from Lecture notes in computer science
#6,007
of 8,126 outputs
Outputs of similar age
#15,614
of 16,183 outputs
Outputs of similar age from Lecture notes in computer science
#4
of 4 outputs
Altmetric has tracked 22,743,667 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 16,183 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 4 others from the same source and published within six weeks on either side of this one.