On the public citation graph

Relating innermost, weak, uniform and modular termination of term rewriting systems

https://doi.org/10.1007/bfb0013069
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-15648-8_20openalex-snapshot
Equational logic as a programming language: Abstract
inferredcites →https://doi.org/10.1007/3-540-51081-8_127openalex-snapshot
Termination for the direct sum of left-linear term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-53904-2_96openalex-snapshot
Completeness of combinations of constructor systems
inferredcites →https://doi.org/10.1007/bfb0013069openalex-snapshot
Relating innermost, weak, uniform and modular termination of term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0013819openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferredcites →https://doi.org/10.1016/0020-0190(87)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(87)90122-0openalex-snapshot
Counterexamples to termination for the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(92)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1989.39194openalex-snapshot
A sufficient condition for the termination of the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/7531.7534openalex-snapshot
On the Church-Rosser property for the direct sum of term rewriting systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1994.1002openalex-snapshot
Completeness of Combinations of Conditional Constructor Systems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_6openalex-snapshot
Completeness of combinations of conditional constructor systems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_9openalex-snapshot
Sufficient conditions for modular termination of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_97openalex-snapshot
Simple termination of hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_14openalex-snapshot
On modularity of termination and confluence properties of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_208openalex-snapshot
Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_10openalex-snapshot
On termination and confluence of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_7openalex-snapshot
Unravelings and ultra-properties
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_71openalex-snapshot
Innocuous constructor-sharing combinations
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_26openalex-snapshot
A Proof of Weak Termination Providing the Right Way to Terminate
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_28openalex-snapshot
Open. Closed. Open.
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_3openalex-snapshot
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
inferred← citeshttps://doi.org/10.1007/bf01190827openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferred← citeshttps://doi.org/10.1007/bf03036465openalex-snapshot
Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
inferred← citeshttps://doi.org/10.1007/bfb0013819openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferred← citeshttps://doi.org/10.1007/bfb0029947openalex-snapshot
When are two rewrite systems more than none?
inferred← citeshttps://doi.org/10.1007/s10817-012-9248-3openalex-snapshot
Uncurrying for Termination and Complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00039-lopenalex-snapshot
On the modularity of termination of term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00248-3openalex-snapshot
Modularity in noncopying term rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00275-4openalex-snapshot
Natural termination
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00080-gopenalex-snapshot
Modular termination of r-consistent and left-linear term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00042-4openalex-snapshot
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.028openalex-snapshot
Proving weak properties of rewriting
inferred← citeshttps://doi.org/10.4064/-46-1-179-225openalex-snapshot
Strong normalization proofs for cut elimination in Gentzen's sequent calculi
showing the first 24 of 25 · page through all 25
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.