On the public citation graph

Partially-static data as free extension of algebras

https://doi.org/10.1145/3236795
0 signed · 31 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/11561347_18openalex-snapshot
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
inferredcites →https://doi.org/10.1007/3-540-47018-2_12openalex-snapshot
A Type Specialisation Tutorial
inferredcites →https://doi.org/10.1007/978-0-387-34897-1_14openalex-snapshot
Binding-time analysis applied to mathematical algorithms
inferredcites →https://doi.org/10.1007/978-3-319-07151-0_6openalex-snapshot
The Design and Implementation of BER MetaOCaml
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_17openalex-snapshot
The Essence of Multi-stage Evaluation in LMS
inferredcites →https://doi.org/10.1007/978-3-540-25935-0_3openalex-snapshot
A Gentle Introduction to Multi-stage Programming
inferredcites →https://doi.org/10.1007/s10990-009-9049-5openalex-snapshot
On typing delimited continuations: three new solutions to the printf problem
inferredcites →https://doi.org/10.1016/j.jlamp.2014.02.001openalex-snapshot
Programming with algebraic effects and handlers
inferredcites →https://doi.org/10.1016/j.scico.2008.09.008openalex-snapshot
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code
inferredcites →https://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferredcites →https://doi.org/10.1017/s0956796898003104openalex-snapshot
Functional unparsing
inferredcites →https://doi.org/10.1023/a:1007763000430openalex-snapshot
inferredcites →https://doi.org/10.1145/1017753.1017794openalex-snapshot
A methodology for generating verified combinatorial circuits
inferredcites →https://doi.org/10.1145/1040305.1040306openalex-snapshot
Associated types with class
inferredcites →https://doi.org/10.1145/2426890.2426906openalex-snapshot
Partially static operations
inferredcites →https://doi.org/10.1145/2426890.2426917openalex-snapshot
Shonan challenge for generative programming
inferredcites →https://doi.org/10.1145/2429069.2429128openalex-snapshot
Optimizing data structures in high-level programs
inferredcites →https://doi.org/10.1145/258993.259019openalex-snapshot
Multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1145/2976022.2976028openalex-snapshot
Generic partially-static data (extended abstract)
inferredcites →https://doi.org/10.1145/3110273openalex-snapshot
Staged generic programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1145/3278122.3278132openalex-snapshot
Funcons for HGMP: the fundamental constructs of homogeneous generative meta-programming (short paper)
inferred← citeshttps://doi.org/10.1145/3393934.3278132openalex-snapshot
Funcons for HGMP: the fundamental constructs of homogeneous generative meta-programming (short paper)
inferred← citeshttps://doi.org/10.1145/3406088.3409021openalex-snapshot
Staged sums of products
inferred← citeshttps://doi.org/10.1145/3471874.3472983openalex-snapshot
Practical normalization by evaluation for EDSLs
inferred← citeshttps://doi.org/10.1145/3498723openalex-snapshot
Staging with class: a specification for typed template Haskell
inferred← citeshttps://doi.org/10.1145/3547641openalex-snapshot
Staged compilation with two-level type theory
inferred← citeshttps://doi.org/10.1145/3547649openalex-snapshot
Normalization for fitch-style modal calculi
inferred← citeshttps://doi.org/10.1145/3674649openalex-snapshot
Staged Compilation with Module Functors
inferred← citeshttps://doi.org/10.1145/3747506openalex-snapshot
Frex: Dependently Typed Algebraic Simplification
inferred← citeshttps://doi.org/10.1145/3798263openalex-snapshot
Fail Faster: Staging and Fast Randomness for High-Performance PBT
inferred← citeshttps://doi.org/10.1145/3828676openalex-snapshot
Let It Be Optimized: Building Multi-stage Evaluators with Let-Insertion and Optimizations in Small Pieces (Functional Pearl)
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.