On the public citation graph
Closed nominal rewriting and efficiently computable nominal algebra equality
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-17220-3_1openalex-snapshot
Term-rewriting implementation of equational logic programming
inferredcites →https://doi.org/10.1007/978-3-540-69937-8_11openalex-snapshot
Nominal Matching and Alpha-Equivalence
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.003openalex-snapshot
Matching and alpha-equivalence check for nominal terms
inferredcites →https://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferredcites →https://doi.org/10.1093/logcom/exp033openalex-snapshot
Nominal (Universal) Algebra: Equational Logic with Names and Binding
inferredcites →https://doi.org/10.1145/2159531.2159532openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferredcites →https://doi.org/10.4230/lipics.rta.2010.209openalex-snapshot
An Efficient Nominal 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/978-3-030-25027-0_5openalex-snapshot
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_1openalex-snapshot
Unification Modulo Equational Theories in Languages with Binding Operators (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_14openalex-snapshot
Principal Types for Nominal Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_21openalex-snapshot
Nominal Completion for Rewrite Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-94-007-6600-6_2openalex-snapshot
Nominal Terms and Nominal Logics: From Foundations to Meta-mathematics
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.004openalex-snapshot
Checking Overlaps of Nominal Rewriting Rules
inferred← citeshttps://doi.org/10.1016/j.entcs.2017.04.003openalex-snapshot
A Formalisation of Nominal α -equivalence with A and AC Function Symbols
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.002openalex-snapshot
Nominal syntax with atom substitutions
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.020openalex-snapshot
A formalisation of nominal α-equivalence with A, C, and AC function symbols
inferred← citeshttps://doi.org/10.1017/s0960129520000122openalex-snapshot
Rewriting with generalized nominal unification
inferred← citeshttps://doi.org/10.1093/jigpal/jzs005openalex-snapshot
Meta-variables as infinite lists in nominal terms unification and rewriting
inferred← citeshttps://doi.org/10.4204/eptcs.71.5openalex-snapshot
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
inferred← citeshttps://doi.org/10.70675/29271e54z880fz42abz8abazc5a5c49735eeopenalex-snapshot
Signatures and models for syntax and operational semantics in the presence of variable binding
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.