On the public citation graph

Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation

https://doi.org/10.1145/328690
0 signed · 18 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4020-6585-9_9openalex-snapshot
Dynamic Programming via Static Incrementalization
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_23openalex-snapshot
Automatic Parallelization of Recursive Functions Using Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_28openalex-snapshot
Staged Computation with Staged Lexical Scope
inferred← citeshttps://doi.org/10.1016/j.scico.2015.10.008openalex-snapshot
Compositional compiler construction: Oberon0
inferred← citeshttps://doi.org/10.1016/j.scico.2016.03.005openalex-snapshot
Embedding attribute grammars and their extensions using functional zippers
inferred← citeshttps://doi.org/10.1016/s1571-0661(03)00007-0openalex-snapshot
Iterate, Incrementalize, and Implement: A Systematic Approach to Efficiency Improvement and Guarantees
inferred← citeshttps://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2011.00387.xopenalex-snapshot
PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST‐CLASS AGENT INTERACTION PROTOCOLS
inferred← citeshttps://doi.org/10.1145/1011508.1011510openalex-snapshot
Polymorphic specialization for ML
inferred← citeshttps://doi.org/10.1145/1017472.1017481openalex-snapshot
Functional pearl
inferred← citeshttps://doi.org/10.1145/1599410.1599426openalex-snapshot
Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas
inferred← citeshttps://doi.org/10.1145/2746325.2746326openalex-snapshot
Type-Directed Elaboration of Quasiquotations
inferred← citeshttps://doi.org/10.1145/3236792openalex-snapshot
Static interpretation of higher-order modules in Futhark: functional GPU programming in the large
inferred← citeshttps://doi.org/10.1145/3276489openalex-snapshot
AnyDSL: a partial evaluation framework for programming high-performance libraries
inferred← citeshttps://doi.org/10.1145/3428232openalex-snapshot
Compiling symbolic execution with staging and algebraic effects
inferred← citeshttps://doi.org/10.1145/366378.366379openalex-snapshot
A slicing-based approach for locating type errors
inferred← citeshttps://doi.org/10.1145/3674649openalex-snapshot
Staged Compilation with Module Functors
inferred← citeshttps://doi.org/10.1145/3763082openalex-snapshot
Tuning Random Generators: Property-Based Testing as Probabilistic Programming
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.