On the public citation graph

Nominal rewriting with name generation

https://doi.org/10.1145/1069774.1069779
0 signed · 56 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/inco.1994.1078openalex-snapshot
Polymorphic Rewriting Conserves Algebraic Confluence
inferredcites →https://doi.org/10.1007/10722010_15openalex-snapshot
A Metalanguage for Programming with Bound Names Modulo Renaming
inferredcites →https://doi.org/10.1007/3-540-45127-7_6openalex-snapshot
From Higher-Order to First-Order Rewriting
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_30openalex-snapshot
The Complexity of Equivariant Unification
inferredcites →https://doi.org/10.1007/978-94-017-0253-9_10openalex-snapshot
The π-Calculus in FM
inferredcites →https://doi.org/10.1007/bfb0014432openalex-snapshot
Modular termination of term rewriting systems revisited
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(91)90037-3openalex-snapshot
Polymorphic rewriting conserves algebraic strong normalization
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.tcs.2004.06.016openalex-snapshot
Nominal unification
inferredcites →https://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferredcites →https://doi.org/10.1016/s0890-5401(03)00138-xopenalex-snapshot
Nominal logic, a first order theory of names and binding
inferredcites →https://doi.org/10.1016/s1571-0661(04)80674-1openalex-snapshot
Translating Combinatory Reduction Systems into the Rewriting Calculus
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1017/s095679689700289xopenalex-snapshot
Modularity of strong normalization in the algebraic-λ-cube
inferredcites →https://doi.org/10.1017/s0960129500003224openalex-snapshot
A λ-calculus with explicit weakening and explicit substitution
inferredcites →https://doi.org/10.1017/s0960129504004633openalex-snapshot
Closed reduction: explicit substitutions without $\alpha$-conversion
inferredcites →https://doi.org/10.1093/jigpal/9.3.339openalex-snapshot
The rewriting calculus - part I
inferredcites →https://doi.org/10.1093/jigpal/9.3.377openalex-snapshot
The rewriting calculus - part II
inferredcites →https://doi.org/10.1093/oso/9780198537359.001.0001openalex-snapshot
Handbook of Logic in Computer Science
inferredcites →https://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferredcites →https://doi.org/10.1109/lics.2003.1210051openalex-snapshot
A proof theory for generic judgments: an extended abstract
inferredcites →https://doi.org/10.1109/lics.2004.6openalex-snapshot
A sequent calculus for nominal logic
inferredcites →https://doi.org/10.1145/1013963.1013978openalex-snapshot
Nominal rewriting systems
inferredcites →https://doi.org/10.1145/174675.174707openalex-snapshot
From λσ to λυ
inferredcites →https://doi.org/10.1145/888251.888266openalex-snapshot
Term rewriting with variable binding
inferredcites →https://doi.org/10.1145/937555.937559openalex-snapshot
Higher-order pattern complement and the strict λ-calculus
inferredcites →https://doi.org/10.1145/944705.944729openalex-snapshot
FreshML
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11921240_14openalex-snapshot
Capture-Avoiding Substitution as a Nominal Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_4openalex-snapshot
Completeness and Incompleteness in Nominal Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_17openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_9openalex-snapshot
Curry-Style Types for Nominal Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_25openalex-snapshot
Freshness and Name-Restriction in Sets of Traces with Names
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_14openalex-snapshot
Stone Duality for Nominal Boolean Algebras with И
inferred← citeshttps://doi.org/10.1007/s00165-007-0056-1openalex-snapshot
Capture-avoiding substitution as a nominal algebra
inferred← citeshttps://doi.org/10.1007/s10990-006-8747-5openalex-snapshot
An initial algebra approach to term rewriting systems with variable binders
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.027openalex-snapshot
Implementing Nominal Unification
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.056openalex-snapshot
Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication
inferred← citeshttps://doi.org/10.1016/j.ic.2006.12.002openalex-snapshot
Nominal rewriting
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.002openalex-snapshot
Nominal syntax with atom substitutions
inferred← citeshttps://doi.org/10.1017/s0956796811000116openalex-snapshot
Structural recursion with locally scoped names
inferred← citeshttps://doi.org/10.1017/s1471068417000035openalex-snapshot
αCheck: A mechanized metatheory model checker
inferred← citeshttps://doi.org/10.1109/lics.2012.63openalex-snapshot
A Higher-Order Distributed Calculus with Name Creation
inferred← citeshttps://doi.org/10.1145/1107523.1107537openalex-snapshot
SIGACT news logic column 14
inferred← citeshttps://doi.org/10.1145/1140612.1140627openalex-snapshot
SIGACT news logic column 15
inferred← citeshttps://doi.org/10.1145/1273920.1273931openalex-snapshot
Mechanized metatheory model-checking
inferred← citeshttps://doi.org/10.1145/2159531.2159532openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.396openalex-snapshot
Relating Two Semantics of Locally Scoped Names
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.209openalex-snapshot
An Efficient Nominal Unification Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0511025openalex-snapshot
Logic Column 14: Nominal Logic and Abstract Syntax
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.