On the public citation graph

Simultaneous critical pairs and Church-Rosser property

https://doi.org/10.1007/bfb0052357
0 signed · 32 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-53904-2_120openalex-snapshot
Open problems in rewriting
inferredcites →https://doi.org/10.1007/3-540-61064-2_39openalex-snapshot
Confluence without termination via parallel critical pairs
inferredcites →https://doi.org/10.1007/3-540-62950-5_70openalex-snapshot
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/s0304-3975(96)00173-9openalex-snapshot
Developing developments
inferredcites →https://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs
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/357162.357169openalex-snapshot
An Efficient Unification Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11805618_6openalex-snapshot
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_19openalex-snapshot
Confluence by Critical Pair Analysis Revisited
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-43369-6_6openalex-snapshot
A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_7openalex-snapshot
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent
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-540-32033-3_28openalex-snapshot
Open. Closed. Open.
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_7openalex-snapshot
Proving Confluence of Term Rewriting Systems Automatically
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_41openalex-snapshot
Decreasing Diagrams and Relative Termination
inferred← citeshttps://doi.org/10.1007/978-981-96-2256-6_39openalex-snapshot
Research on Trajectory Conflict Detection and Resolution for TBO
inferred← citeshttps://doi.org/10.1007/s10817-011-9238-xopenalex-snapshot
Decreasing Diagrams and Relative Termination
inferred← citeshttps://doi.org/10.1007/s10817-014-9316-yopenalex-snapshot
Labelings for Decreasing Diagrams
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.06.015openalex-snapshot
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00340-0openalex-snapshot
Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem
inferred← citeshttps://doi.org/10.1145/3703595.3705881openalex-snapshot
Formalizing Simultaneous Critical Pairs for Confluence of Left-Linear Rewrite Systems
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.4230/lipics.fscd.2022.28openalex-snapshot
Compositional Confluence Criteria
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.7openalex-snapshot
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
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.46298/lmcs-20(1:6)2024openalex-snapshot
Compositional Confluence Criteria
inferred← citeshttps://doi.org/10.48550/arxiv.1905.11733openalex-snapshot
Confluence by Critical Pair Analysis Revisited (Extended Version)
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.