On the public citation graph
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem
0 signed · 44 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-18508-9openalex-snapshot
Category Theory and Computer Science
inferredcites →https://doi.org/10.1007/3-540-19242-5openalex-snapshot
Conditional Term Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-45610-4_4openalex-snapshot
Axiomatic Rewriting Theory VI: Residual Theory Revisited
inferredcites →https://doi.org/10.1007/3-540-55808-x_19openalex-snapshot
Strong normalization of substitutions
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-642-79361-5_7openalex-snapshot
Rewrite Proofs and Computations
inferredcites →https://doi.org/10.1007/978-3-642-79361-5_8openalex-snapshot
Action Structures and the Pi Calculus
inferredcites →https://doi.org/10.1007/bfb0014062openalex-snapshot
Typed λ-calculi with explicit substitutions may not terminate
inferredcites →https://doi.org/10.1007/bfb0026981openalex-snapshot
A factorisation theorem in rewriting theory
inferredcites →https://doi.org/10.1007/bfb0032041openalex-snapshot
Stability and sequentiality in dataflow networks
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(89)90105-9openalex-snapshot
Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0304-3975(96)00097-7openalex-snapshot
Towards a proof theory of rewriting: The simply typed 2λ-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(96)80713-4openalex-snapshot
Towards a proof theory of rewriting: the simply typed 2λ-calculus
inferredcites →https://doi.org/10.1017/cbo9780511525896openalex-snapshot
Higher Operads, Higher Categories
inferredcites →https://doi.org/10.1017/s0960129500070092openalex-snapshot
Event structures and non-orthogonal term graph rewriting
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501858-0openalex-snapshot
Some properties of conversion
inferredcites →https://doi.org/10.1093/logcom/10.3.461openalex-snapshot
Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones
inferredcites →https://doi.org/10.1093/oso/9780198537359.001.0001openalex-snapshot
Handbook of Logic in Computer Science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1998.705665openalex-snapshot
A stability theorem in rewriting theory
inferredcites →https://doi.org/10.1145/232627.232632openalex-snapshot
Functional back-ends within the lambda-sigma calculus
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
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/3-540-45610-4_4openalex-snapshot
Axiomatic Rewriting Theory VI: Residual Theory Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_2openalex-snapshot
Factoring Derivation Spaces via Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_7openalex-snapshot
Abstract Strategies and Coherence
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/s00153-007-0039-1openalex-snapshot
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.10.003openalex-snapshot
(In)Efficiency and Reasonable Cost Models
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.006openalex-snapshot
Reduction strategies in rewriting and programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80599-1openalex-snapshot
Four equivalent equivalences of reductions
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175807openalex-snapshot
Allegories of Symbolic Manipulations
inferred← citeshttps://doi.org/10.1145/2535838.2535886openalex-snapshot
A nonstandard standardization theorem
inferred← citeshttps://doi.org/10.1145/2578855.2535886openalex-snapshot
A nonstandard standardization theorem
inferred← citeshttps://doi.org/10.4204/eptcs.377.2openalex-snapshot
On Causal Equivalence by Tracing in String Rewriting
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.