On the public citation graph

On the modularity of confluence of constructor-sharing term rewriting systems

https://doi.org/10.1007/bfb0017487
0 signed · 33 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.1006/jsco.1993.1024openalex-snapshot
Completeness of Combinations of Constructor Systems
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-56868-9_39openalex-snapshot
More problems in rewriting
inferredcites →https://doi.org/10.1007/bf01190827openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
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)90122-0openalex-snapshot
Counterexamples to termination for the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(90)90221-iopenalex-snapshot
Modular term rewriting systems and the termination
inferredcites →https://doi.org/10.1016/0020-0190(94)00187-4openalex-snapshot
Termination is not modular for confluent variable-preserving 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/0304-3975(94)00039-lopenalex-snapshot
On the modularity of termination of term rewriting systems
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1145/322217.322229openalex-snapshot
Operational and Semantic Equivalence Between Recursive Programs
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.1995.1036openalex-snapshot
Modular Properties of Composable 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-59200-8_82openalex-snapshot
Problems in rewriting III
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_18openalex-snapshot
Modular properties of constructor-sharing conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_58openalex-snapshot
Compositional term rewriting: An algebraic proof of Toyama's theorem
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_71openalex-snapshot
Innocuous constructor-sharing combinations
inferred← citeshttps://doi.org/10.1007/978-3-031-16767-6_2openalex-snapshot
Confluence Framework: Proving Confluence with CONFident
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_5openalex-snapshot
Abstract Modularity
inferred← citeshttps://doi.org/10.1007/bfb0017469openalex-snapshot
Trees in Algebra and Programming — CAAP'94
inferred← citeshttps://doi.org/10.1007/bfb0029947openalex-snapshot
When are two rewrite systems more than none?
inferred← citeshttps://doi.org/10.1007/bfb0052380openalex-snapshot
An on-line problem database
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(95)00075-8openalex-snapshot
Modular proofs for completeness of hierarchical 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.2012.09.008openalex-snapshot
Modularity in term rewriting revisited
inferred← citeshttps://doi.org/10.1145/2710017openalex-snapshot
Layer Systems for Proving Confluence
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:19)2014openalex-snapshot
Modular Complexity Analysis for Term Rewriting
inferred← citeshttps://doi.org/10.3233/fi-1995-24121openalex-snapshot
ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.385openalex-snapshot
Modular Complexity Analysis via Relative Complexity
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.