On the public citation graph

Callee-save registers in continuation-passing style

https://doi.org/10.1007/bf01807505
0 signed · 36 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.1002/spe.4380190206openalex-snapshot
Simple generational garbage collection and fast allocation
inferredcites →https://doi.org/10.1007/3-540-15975-4_29openalex-snapshot
The categorical abstract machine
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
inferredcites →https://doi.org/10.1007/3-540-18317-5_17openalex-snapshot
A standard ML compiler
inferredcites →https://doi.org/10.1016/0020-0190(87)90175-xopenalex-snapshot
Garbage collection can be faster than stack allocation
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1145/12276.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
inferredcites →https://doi.org/10.1145/800055.802037openalex-snapshot
Compiling a functional language
inferredcites →https://doi.org/10.1145/93542.93554openalex-snapshot
Representing control in the presence of first-class continuations
inferredcites →https://doi.org/10.1145/960116.53999openalex-snapshot
Minimizing register usage penalty at procedure calls
inferredcites →https://doi.org/10.1145/989393.989414openalex-snapshot
Orbit
inferredcites →https://doi.org/10.1145/989393.989417openalex-snapshot
Real-time concurrent collection on stock multiprocessors

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-54444-5_83openalex-snapshot
Standard ML of New Jersey
inferred← citeshttps://doi.org/10.1007/bfb0055511openalex-snapshot
Stack-based Typed Assembly Language
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)80001-0openalex-snapshot
Return value placement and tail call optimization in high level languages
inferred← citeshttps://doi.org/10.1017/s095679680000157xopenalex-snapshot
Empirical and analytic study of stack versus heap cost for languages with closures
inferred← citeshttps://doi.org/10.1017/s0956796801004178openalex-snapshot
Stack-based typed assembly language
inferred← citeshttps://doi.org/10.1109/iccd53106.2021.00070openalex-snapshot
Compiling and Optimizing Real-world Programs for STRAIGHT ISA
inferred← citeshttps://doi.org/10.1145/182409.156783openalex-snapshot
Space-efficient closure representations
inferred← citeshttps://doi.org/10.1145/182590.156783openalex-snapshot
Space-efficient closure representations
inferred← citeshttps://doi.org/10.1145/207110.207123openalex-snapshot
A type-based compiler for standard ML
inferred← citeshttps://doi.org/10.1145/207110.207125openalex-snapshot
Register allocation using lazy saves, eager restores, and greedy shuffling
inferred← citeshttps://doi.org/10.1145/223428.207123openalex-snapshot
A type-based compiler for standard ML
inferred← citeshttps://doi.org/10.1145/223428.207125openalex-snapshot
Register allocation using lazy saves, eager restores, and greedy shuffling
inferred← citeshttps://doi.org/10.1145/224164.224215openalex-snapshot
Interprocedural register allocation for lazy functional languages
inferred← citeshttps://doi.org/10.1145/229542.229546openalex-snapshot
Iterated register coalescing
inferred← citeshttps://doi.org/10.1145/237721.237777openalex-snapshot
Iterated register coalescing
inferred← citeshttps://doi.org/10.1145/3385412.3385994openalex-snapshot
From folklore to fact: comparing implementations of stacks and continuations
inferred← citeshttps://doi.org/10.1145/3386336openalex-snapshot
The history of Standard ML
inferred← citeshttps://doi.org/10.1145/345099.345125openalex-snapshot
Efficient and safe-for-space closure conversion
inferred← citeshttps://doi.org/10.1145/3462172.3462191openalex-snapshot
A New Backend for Standard ML of New Jersey
inferred← citeshttps://doi.org/10.1145/3578360.3580263openalex-snapshot
A Sound and Complete Algorithm for Code Generation in Distance-Based ISA
inferred← citeshttps://doi.org/10.1145/3747516openalex-snapshot
Environment-Sharing Analysis and Caller-Provided Environments for Higher-Order Languages
inferred← citeshttps://doi.org/10.1145/3808262openalex-snapshot
Flow-Analysis-Based Closure Optimization
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.