On the public citation graph

Church-Rosser theorems for replacement systems

https://doi.org/10.1007/bfb0062861
0 signed · 37 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/bf02008531openalex-snapshot
Ein algebraischer Beweis für das Church-Rosser-Theorem
inferredcites →https://doi.org/10.1017/s0022481200128439openalex-snapshot
An Abstract form of the church-rosser theorem. I
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.2307/2270849openalex-snapshot
An Abstract form of the church-rosser theorem. I
inferredcites →https://doi.org/10.2307/2272337openalex-snapshot
An abstract Church-Rosser theorem. II: Applications

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1997.2683openalex-snapshot
Diagram Techniques for Confluence
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_11openalex-snapshot
A taste of 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/978-3-540-32033-3_1openalex-snapshot
Confluent Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_5openalex-snapshot
On Lazy Commutation
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-7091-3406-1_2openalex-snapshot
Algebraic Simplification
inferred← citeshttps://doi.org/10.1007/978-3-7091-7551-4_2openalex-snapshot
Algebraic Simplification
inferred← citeshttps://doi.org/10.1007/bf02945519openalex-snapshot
Some results on the confluence property of combined Term Rewriting Systems
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/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0027008openalex-snapshot
Conditional term graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0029947openalex-snapshot
When are two rewrite systems more than none?
inferred← citeshttps://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferred← citeshttps://doi.org/10.1007/bfb0035166openalex-snapshot
Reduction relations in strict applicative languages
inferred← citeshttps://doi.org/10.1007/bfb0052358openalex-snapshot
Church-Rosser theorems for abstract reduction modulo an equivalence relation
inferred← citeshttps://doi.org/10.1007/s10559-021-00407-0openalex-snapshot
The Replenishment Algorithm in Algebras of Sets
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90014-xopenalex-snapshot
Unique normal forms for lambda calculus with surjective pairing
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferred← citeshttps://doi.org/10.1016/b978-0-444-87508-2.50035-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.013openalex-snapshot
Jumping and escaping: Modular termination and the abstract path ordering
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00209-7openalex-snapshot
Implementing conditional term rewriting by graph rewriting
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1017/s0004972700023443openalex-snapshot
Optimal reduction in replacement systems
inferred← citeshttps://doi.org/10.1093/logcom/10.3.437openalex-snapshot
A geometric proof of confluence by decreasing diagrams
inferred← citeshttps://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferred← citeshttps://doi.org/10.1145/7531.7534openalex-snapshot
On the Church-Rosser property for the direct sum of term rewriting systems
inferred← citeshttps://doi.org/10.1201/b11046-12openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1201/b21197-4openalex-snapshot
Functorial Admissible Models
inferred← citeshttps://doi.org/10.1201/b21197-5openalex-snapshot
Initial Tree Computing and Languages
inferred← citeshttps://doi.org/10.2178/jsl/1045861508openalex-snapshot
The Church-Rosser property in dual combinatory logic
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.