On the public citation graph

Church-Rosser theorems for abstract reduction modulo an equivalence relation

https://doi.org/10.1007/bfb0052358
0 signed · 30 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-58140-5_27openalex-snapshot
An abstract property of confluence applied to the study of the lazy partial lambda calculus
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_11openalex-snapshot
Termination of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1007/978-3-642-79351-6openalex-snapshot
Reduktionssysteme
inferredcites →https://doi.org/10.1007/bfb0062861openalex-snapshot
Church-Rosser theorems for replacement systems
inferredcites →https://doi.org/10.1016/0304-3975(92)00023-kopenalex-snapshot
Confluence by decreasing diagrams
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/321850.321862openalex-snapshot
Testing for the Church-Rosser Property
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to 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.1007/11560586_10openalex-snapshot
The Graph Rewriting Calculus: Confluence and Expressiveness
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_3openalex-snapshot
Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_17openalex-snapshot
Ground Confluence and Strong Commutation Modulo Alpha-Equivalence in Nominal Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_7openalex-snapshot
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-90686-7_8openalex-snapshot
Confluence Modulo Equivalence with Invariants in Constraint Handling Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_20openalex-snapshot
The Theory of Calculi with Explicit Substitutions Revisited
inferred← citeshttps://doi.org/10.1007/s10990-007-9004-2openalex-snapshot
A ρ-calculus of explicit constraint application
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.029openalex-snapshot
A ρ-Calculus of Explicit Constraint Application
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.034openalex-snapshot
A Rewriting Calculus for Cyclic Higher-order Term Graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.057openalex-snapshot
Towards a Sharing Strategy for the Graph Rewriting Calculus
inferred← citeshttps://doi.org/10.1016/j.fss.2014.11.001openalex-snapshot
Rewriting systems over similarity and generalized pseudometric spaces and their properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.030openalex-snapshot
From diagrammatic confluence to modularity
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00023-3openalex-snapshot
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
inferred← citeshttps://doi.org/10.1017/s0960129507006093openalex-snapshot
A rewriting calculus for cyclic higher-order term graphs
inferred← citeshttps://doi.org/10.1145/3696443.3708923openalex-snapshot
Honey Potion: An eBPF Backend for Elixir
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:31)2012openalex-snapshot
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
inferred← citeshttps://doi.org/10.29007/7q54openalex-snapshot
Critical Pair Analysis in Nominal Rewriting
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.91openalex-snapshot
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
inferred← citeshttps://doi.org/10.4230/lipics.rta.2013.174openalex-snapshot
Proof Orders for Decreasing Diagrams
inferred← citeshttps://doi.org/10.4230/lipics.rta.2015.301openalex-snapshot
Confluence of Orthogonal Nominal Rewriting Systems Revisited
inferred← citeshttps://doi.org/10.70675/61298c17z330ez4003za994zae4f9bbca447openalex-snapshot
Identity of Proofs and Formulas using Proof-Nets in Multiplicative-Additive Linear 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.