On the public citation graph
On higher order recursive program schemes
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-56868-9_19openalex-snapshot
Optimal normalization in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-57785-8_139openalex-snapshot
Perpetuality and strong normalization in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-58140-5_20openalex-snapshot
The longest perpetual reductions in Orthogonal Expression Reduction Systems
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/s0960129500000566openalex-snapshot
Interaction Systems I: The theory of optimal reductions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2750openalex-snapshot
Perpetual Reductions inλ-Calculus
inferred← citeshttps://doi.org/10.1006/inco.2000.2888openalex-snapshot
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
inferred← citeshttps://doi.org/10.1007/10703163_18openalex-snapshot
Normalization of Typable Terms by Superdevelopments
inferred← citeshttps://doi.org/10.1007/11601548_22openalex-snapshot
Expression Reduction Systems and Extensions: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_9openalex-snapshot
Relative normalization in orthogonal expression reduction systems
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_9openalex-snapshot
Discrete Normalization and Standardization in Deterministic Residual Structures
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_53openalex-snapshot
Minimal relative normalization in orthogonal expression reduction systems
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_219openalex-snapshot
The geometry of orthogonal reduction spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-11881-4openalex-snapshot
Automata for Branching and Layered Temporal Structures : An Investigation into Regularities of Infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/bfb0027014openalex-snapshot
Perpetuality and uniform normalization
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.037openalex-snapshot
The conflict-free Reduction Geometry
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00372-8openalex-snapshot
On the longest perpetual reductions in orthogonal expression reduction systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80205-1openalex-snapshot
Semagraph: the Theory and Practice of Term Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s1755020310000286openalex-snapshot
ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM
inferred← citeshttps://doi.org/10.1093/logcom/10.3.323openalex-snapshot
Stable results and relative normalization
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.