On the public citation graph
Closure conversion is safe for space
0 signed · 53 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/978-1-4471-3196-0openalex-snapshot
Functional Programming, Glasgow 1991
inferredcites →https://doi.org/10.1007/978-1-4471-3196-0_24openalex-snapshot
Operational Theories of Improvement in Functional Languages
inferredcites →https://doi.org/10.1007/978-3-319-66107-0_6openalex-snapshot
CompCertS: A Memory-Aware Verified C Compiler Using Pointer as Integer Semantics
inferredcites →https://doi.org/10.1007/978-3-642-32495-6_5openalex-snapshot
Certifying and Reasoning on Cost Annotations of Functional Programs
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_17openalex-snapshot
Refinement Types for Incremental Computational Complexity
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1016/s1571-0661(05)80284-1openalex-snapshot
A Foundation for Space-Safe Transformations of Call-by-Need Programs
inferredcites →https://doi.org/10.1016/s1571-0661(05)80286-5openalex-snapshot
Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s095679680000157xopenalex-snapshot
Empirical and analytic study of stack versus heap cost for languages with closures
inferredcites →https://doi.org/10.1145/143095.143140openalex-snapshot
Compiler support for garbage collection in a statically typed language
inferredcites →https://doi.org/10.1145/1542431.1542451openalex-snapshot
Parametric heap usage analysis for functional programs
inferredcites →https://doi.org/10.1145/1706299.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/1806651.1806671openalex-snapshot
Parametric inference of memory requirements for garbage collected languages
inferredcites →https://doi.org/10.1145/182409.156783openalex-snapshot
Space-efficient closure representations
inferredcites →https://doi.org/10.1145/1863543.1863584openalex-snapshot
A certified framework for compiling and executing garbage-collected languages
inferredcites →https://doi.org/10.1145/1925844.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/1926385.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/2103656.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/2594291.2594301openalex-snapshot
End-to-end verification of stack-space bounds for C programs
inferredcites →https://doi.org/10.1145/2661103.2661106openalex-snapshot
Optimizing closures in O(0) time
inferredcites →https://doi.org/10.1145/2666356.2594301openalex-snapshot
End-to-end verification of stack-space bounds for C programs
inferredcites →https://doi.org/10.1145/2784731.2784764openalex-snapshot
Pilsner: a compositionally verified compiler for a higher-order imperative language
inferredcites →https://doi.org/10.1145/2951913.2951950openalex-snapshot
A type theory for incremental computational complexity with control flow changes
inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3133903openalex-snapshot
TiML: a functional language for practical complexity analysis with invariants
inferredcites →https://doi.org/10.1145/345099.345125openalex-snapshot
Efficient and safe-for-space closure conversion
inferredcites →https://doi.org/10.1145/507635.507667openalex-snapshot
Possibilities and limitations of call-by-need space improvement
inferredcites →https://doi.org/10.1145/75277.75302openalex-snapshot
Realistic compilation by program transformation (detailed summary)
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_2openalex-snapshot
Verified Transformation of Continuation-Passing Style into Static Single Assignment Form
inferred← citeshttps://doi.org/10.1145/3441296.3441398openalex-snapshot
Strictly capturing non-strict closures
inferred← citeshttps://doi.org/10.1145/3460120.3484761openalex-snapshot
Structured Leakage and Applications to Cryptographic Constant-Time and Cost
inferred← citeshttps://doi.org/10.1145/3473591openalex-snapshot
Compositional optimizations for CertiCoq
inferred← citeshttps://doi.org/10.1145/3485491openalex-snapshot
Compiling with continuations, correctly
inferred← citeshttps://doi.org/10.1145/3486606.3486783openalex-snapshot
A small scheme VM, compiler, and REPL in 4k
inferred← citeshttps://doi.org/10.1145/3531130.3533362openalex-snapshot
Reasonable Space for the λ-Calculus, Logarithmically
inferred← citeshttps://doi.org/10.1145/3547634openalex-snapshot
Reference counting with frame limited reuse
inferred← citeshttps://doi.org/10.1145/3571218openalex-snapshot
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)
inferred← citeshttps://doi.org/10.1145/3591241openalex-snapshot
Defunctionalization with Dependent Types
inferred← citeshttps://doi.org/10.1145/3610612.3610622openalex-snapshot
Closure Conversion in Little Pieces
inferred← citeshttps://doi.org/10.1145/3704860openalex-snapshot
A Verified Foreign Function Interface between Coq and C
inferred← citeshttps://doi.org/10.1145/3704880openalex-snapshot
Preservation of Speculative Constant-Time by Compilation
inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
inferred← citeshttps://doi.org/10.1145/3756907.3756922openalex-snapshot
Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
inferred← citeshttps://doi.org/10.1145/3779031.3779088openalex-snapshot
Foundational Verification of Running-Time Bounds for Interactive Programs
inferred← citeshttps://doi.org/10.1145/3808262openalex-snapshot
Flow-Analysis-Based Closure Optimization
inferred← citeshttps://doi.org/10.3390/math10203800openalex-snapshot
On Coevaluation Behavior and Equivalence
inferred← citeshttps://doi.org/10.3390/math8091573openalex-snapshot
Coinductive Natural Semantics for Compiler Verification in Coq
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.