On the public citation graph

A grammar-based data-flow analysis to stop deforestation

https://doi.org/10.1007/bfb0017492
0 signed · 35 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-16446-4_16openalex-snapshot
Listlessness is better than laziness II: Composing listless functions
inferredcites →https://doi.org/10.1007/3-540-19027-9_23openalex-snapshot
Deforestation: Transforming programs to eliminate trees
inferredcites →https://doi.org/10.1007/3-540-57880-3_32openalex-snapshot
Towards unifying partial evaluation, deforestation, supercompilation, and GPC
inferredcites →https://doi.org/10.1016/0304-3975(90)90147-aopenalex-snapshot
Deforestation: transforming programs to eliminate trees
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.030openalex-snapshot
Flow analysis of lazy higher-order functional programs
inferredcites →https://doi.org/10.1017/s0956796800001179openalex-snapshot
Safe fusion of functional expressions II: Further improvements
inferredcites →https://doi.org/10.1145/15042.15053openalex-snapshot
An overview of Miranda
inferredcites →https://doi.org/10.1145/800055.802020openalex-snapshot
Listlessness is better than laziness
inferredcites →https://doi.org/10.1145/800068.802134openalex-snapshot
Experiments with a supercompiler

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-46562-6_6openalex-snapshot
The Essence of Program Transformation by Partial Evaluation and Driving
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_14openalex-snapshot
Eliminating Dead Code on Recursive Data
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_32openalex-snapshot
Towards unifying partial evaluation, deforestation, supercompilation, and GPC
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_13openalex-snapshot
Partial deduction and driving are equivalent
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_228openalex-snapshot
Proving the correctness of recursion-based automatic program transformations
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_46openalex-snapshot
Integer constraints to stop deforestation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_14openalex-snapshot
Squeezing intermediate construction in equational programs
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_87openalex-snapshot
Higher order deforestation
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_24openalex-snapshot
Polyvariant expansion and compiler generators
inferred← citeshttps://doi.org/10.1007/978-3-030-98869-2_7openalex-snapshot
The Next 700 Program Transformers
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_13openalex-snapshot
Extracting the Essence of Distillation
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_15openalex-snapshot
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0017469openalex-snapshot
Trees in Algebra and Programming — CAAP'94
inferred← citeshttps://doi.org/10.1007/bfb0026823openalex-snapshot
Better consumers for deforestation
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00134-xopenalex-snapshot
Eliminating dead code on recursive data
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00031-2openalex-snapshot
Constraints to stop deforestation
inferred← citeshttps://doi.org/10.1109/iccl.1998.674171openalex-snapshot
Dependence analysis for recursive data
inferred← citeshttps://doi.org/10.1145/1244381.1244391openalex-snapshot
Distillation
inferred← citeshttps://doi.org/10.1145/224164.224199openalex-snapshot
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
inferred← citeshttps://doi.org/10.1145/224164.224221openalex-snapshot
Shortcut deforestation in calculational form
inferred← citeshttps://doi.org/10.1145/258915.258935openalex-snapshot
Two for the price of one
inferred← citeshttps://doi.org/10.1145/263699.263758openalex-snapshot
Constraints to stop higher-order deforestation
inferred← citeshttps://doi.org/10.1145/503032.503036openalex-snapshot
From checking to inference via driving and dag grammars
inferred← citeshttps://doi.org/10.1145/509799.503036openalex-snapshot
From checking to inference via driving and dag grammars
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.