On the public citation graph
Design and Implementation of Programming Languages
0 signed · 42 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/bfb0021419openalex-snapshot
Section IV programming language specifications, optimization and run-time support systems
inferredcites →https://doi.org/10.1007/bfb0021427openalex-snapshot
Separate definition and compilation in lis and its implementation
inferredcites →https://doi.org/10.1007/bfb0021430openalex-snapshot
Target computer independent optimization procedures for metacompilers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380170904openalex-snapshot
Fixing some space leaks with a garbage collector
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_10openalex-snapshot
Distributed garbage collection using reference counting
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_7openalex-snapshot
On the Correctness of the Factoring Transformation
inferred← citeshttps://doi.org/10.1007/3-540-48515-5_12openalex-snapshot
Putting the Spine Back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_74openalex-snapshot
Parallel associative combinator evaluation
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_44openalex-snapshot
Efficient closure utilisation by higher-order inheritance analysis
inferred← citeshttps://doi.org/10.1007/3540512845_41openalex-snapshot
An efficient distributed garbage collection algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_23openalex-snapshot
Some Ideas On Parallel Functional Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_13openalex-snapshot
Compilation by Transformation in the Glasgow Haskell Compiler
inferred← citeshttps://doi.org/10.1007/978-1-4471-3810-5_8openalex-snapshot
Towards Binding-Time Improvement for Free
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_47openalex-snapshot
Parallel Associative Combinator Evaluation
inferred← citeshttps://doi.org/10.1007/bf01019945openalex-snapshot
Call-by-need and continuation-passing style
inferred← citeshttps://doi.org/10.1007/bf03037471openalex-snapshot
Lazy debugging of lazy functional programs
inferred← citeshttps://doi.org/10.1016/0164-1212(81)90042-xopenalex-snapshot
Embedded system design with ada as the system design language
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90065-jopenalex-snapshot
Parallel associative combinator evaluation II
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90127-0openalex-snapshot
An efficient reference counting solution to the distributed garbage collection problem
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00029-4openalex-snapshot
A transformation-based optimiser for Haskell
inferred← citeshttps://doi.org/10.1017/s0956796800000708openalex-snapshot
Heap profiling of lazy functional programs
inferred← citeshttps://doi.org/10.1017/s0956796898003037openalex-snapshot
The call-by-need lambda calculus
inferred← citeshttps://doi.org/10.1093/comjnl/35.2.170openalex-snapshot
The Categorical Multi-Combinator Machine: CMCM
inferred← citeshttps://doi.org/10.1145/800055.802020openalex-snapshot
Listlessness is better than laziness
inferred← citeshttps://doi.org/10.1515/9783110325461.518openalex-snapshot
Church’s Thesis and Functional Programming
inferred← citeshttps://doi.org/10.15439/2015f156openalex-snapshot
A step towards genuine declarative language-integrated queries
inferred← citeshttps://doi.org/10.2307/2274655openalex-snapshot
Some improvements to Turner's algorithm for bracket abstraction
inferred← citeshttps://doi.org/10.3990/1.9789090075945openalex-snapshot
On an extension of functional languages for use in prototyping
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:5)2024openalex-snapshot
Node Replication: Theory And Practice
inferred← citeshttps://doi.org/10.7146/dpb.v20i344.6574openalex-snapshot
What is an Efficient Implementation of the lambda-calculus?
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.