On the public citation graph
Efficient multi-level generating extensions for program specialization
0 signed · 109 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/3-540-50820-1openalex-snapshot
Programming Languages Implementation and Logic Programming
inferredcites →https://doi.org/10.1007/3-540-52592-0_57openalex-snapshot
From interpreting to compiling binding times
inferredcites →https://doi.org/10.1007/3-540-57880-3_32openalex-snapshot
Towards unifying partial evaluation, deforestation, supercompilation, and GPC
inferredcites →https://doi.org/10.1007/3-540-58402-1_15openalex-snapshot
Hand-writing program generator generators
inferredcites →https://doi.org/10.1007/3-540-58485-4_57openalex-snapshot
Generating transformers for deforestation and supercompilation
inferredcites →https://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferredcites →https://doi.org/10.1007/bfb0026826openalex-snapshot
Mechanically verifying the correctness of an offline partial evaluator
inferredcites →https://doi.org/10.1016/0004-3702(76)90011-4openalex-snapshot
A partial evaluator, and its use as a programming tool
inferredcites →https://doi.org/10.1016/0167-6423(91)90002-fopenalex-snapshot
Automatic autoprojection of recursive equations with global variables and abstract data types
inferredcites →https://doi.org/10.1016/0167-6423(91)90035-vopenalex-snapshot
Automatic autoprojection of higher order recursive equations
inferredcites →https://doi.org/10.1016/0890-5401(91)90020-3openalex-snapshot
Type inference with recursive types: Syntax and semantics
inferredcites →https://doi.org/10.1017/cbo9780511526572openalex-snapshot
Two-Level Functional Languages
inferredcites →https://doi.org/10.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferredcites →https://doi.org/10.1017/s0956796800000782openalex-snapshot
Specifying the correctness of binding-time analysis
inferredcites →https://doi.org/10.1017/s0956796800001167openalex-snapshot
On the generation of specializers
inferredcites →https://doi.org/10.1145/115865.115900openalex-snapshot
Towards multiple self-application
inferredcites →https://doi.org/10.1145/115866.115900openalex-snapshot
Towards multiple self-application
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561347_21openalex-snapshot
Statically Safe Program Generation with SafeGen
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_23openalex-snapshot
A Monadic Multi-stage Metalanguage
inferred← citeshttps://doi.org/10.1007/3-540-44806-3_10openalex-snapshot
Dynamically Adaptable Software with Metacomputations in a Staged Language
inferred← citeshttps://doi.org/10.1007/3-540-44806-3_2openalex-snapshot
Accomplishments and Research Challenges in Meta-programming
inferred← citeshttps://doi.org/10.1007/3-540-45821-2_20openalex-snapshot
Managing Dynamic Changes in Multi-stage Program Generation Systems
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_18openalex-snapshot
On the mechanics of metasystem hierarchies in program transformation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_17openalex-snapshot
Multi-Level Lambda-Calculi: An algebraic description
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_23openalex-snapshot
Self-applicable online partial evaluation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_6openalex-snapshot
Compiler generation for interactive graphics using intermediate code
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_8openalex-snapshot
A roadmap to metacomputation by supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_9openalex-snapshot
Reasoning about hierarchies of online program specialization systems
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_86openalex-snapshot
Implementing memoization for partial evaluation
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_22openalex-snapshot
Fast binding-time analysis for multi-level specialization
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_7openalex-snapshot
On Cross-Stage Persistence in Multi-Stage Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_22openalex-snapshot
Binding-Time Analysis for MetaML via Type Inference and Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_8openalex-snapshot
LIX: an Effective Self-applicable Partial Evaluator for Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-39815-8_4openalex-snapshot
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection
inferred← citeshttps://doi.org/10.1007/978-3-540-39815-8_5openalex-snapshot
On Stage Ordering in Staged Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_39openalex-snapshot
Calculi of Meta-variables
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_14openalex-snapshot
Deriving Compilers and Virtual Machines for a Multi-level Language
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_25openalex-snapshot
A Logical Foundation for Environment Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_12openalex-snapshot
An Experiment with the Fourth Futamura Projection
inferred← citeshttps://doi.org/10.1007/978-3-642-45293-2_6openalex-snapshot
Pruning False Positives of Static Data-Race Detection via Thread Specialization
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_78openalex-snapshot
Program Generation with Class
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_13openalex-snapshot
An ML-Style Module System for Cross-Stage Type Abstraction in Multi-stage Programming
inferred← citeshttps://doi.org/10.1007/bf03037321openalex-snapshot
On the degeneration of program generators by program composition
inferred← citeshttps://doi.org/10.1007/bfb0014551openalex-snapshot
Sound specialization in the presence of computational effects
inferred← citeshttps://doi.org/10.1007/bfb0033849openalex-snapshot
Evaluation under lambda abstraction
inferred← citeshttps://doi.org/10.1007/s10990-008-9033-5openalex-snapshot
An investigation of Jones optimality and BTI-universal specializers
inferred← citeshttps://doi.org/10.1016/j.ic.2010.09.008openalex-snapshot
Constructive linear-time temporal logic: Proof systems and Kripke semantics
inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.011openalex-snapshot
A tour of Tempo: a program specializer for the C language
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103379openalex-snapshot
An ML-style module system for cross-stage type abstraction in multi-stage programming
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00055-0openalex-snapshot
A regeneration scheme for generating extensions
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00050-5openalex-snapshot
Extending a partial evaluator which supports separate compilation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00053-0openalex-snapshot
MetaML and multi-stage programming with explicit annotations
inferred← citeshttps://doi.org/10.1017/s095679680500568xopenalex-snapshot
Staged computation with names and necessity
inferred← citeshttps://doi.org/10.1017/s0956796899003469openalex-snapshot
Combinators for program generation
inferred← citeshttps://doi.org/10.1017/s0960129515000109openalex-snapshot
Type safe incremental rebinding
inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1023/a:1018739006820openalex-snapshot
Initial Results for Glacial Variable Analysis
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395215openalex-snapshot
Partial-Evaluation Templates: Accelerating Partial Evaluation with Pre-compiled Templates
inferred← citeshttps://doi.org/10.1109/lics.1996.561317openalex-snapshot
A temporal-logic approach to binding-time analysis
inferred← citeshttps://doi.org/10.1145/1111542.1111557openalex-snapshot
The Ecce and Logen partial evaluators and their web interfaces
inferred← citeshttps://doi.org/10.1145/1140335.1140360openalex-snapshot
A modal type system for multi-level generating extensions with persistent code
inferred← citeshttps://doi.org/10.1145/1480945.1480954openalex-snapshot
Is there a fourth Futamura projection?
inferred← citeshttps://doi.org/10.1145/1653662.1653703openalex-snapshot
Privacy-preserving genomic computation through program specialization
inferred← citeshttps://doi.org/10.1145/2254064.2254090openalex-snapshot
Sound and precise analysis of parallel programs through schedule specialization
inferred← citeshttps://doi.org/10.1145/231379.231407openalex-snapshot
Optimizing ML with run-time code generation
inferred← citeshttps://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferred← citeshttps://doi.org/10.1145/237721.237788openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.1145/258993.258996openalex-snapshot
Partial evaluation and separate compilation
inferred← citeshttps://doi.org/10.1145/258993.259008openalex-snapshot
Generating efficient virtual worlds for visualization using partial evaluation and dynamic compilation
inferred← citeshttps://doi.org/10.1145/258993.259017openalex-snapshot
Resource-bounded partial evaluation
inferred← citeshttps://doi.org/10.1145/258993.259018openalex-snapshot
Prescriptive Frameworks for Multi-Level Lambda-Calculi
inferred← citeshttps://doi.org/10.1145/258993.259019openalex-snapshot
Multi-stage programming with explicit annotations
inferred← citeshttps://doi.org/10.1145/2661103.2661109openalex-snapshot
Hygienic quasiquotation in scheme
inferred← citeshttps://doi.org/10.1145/277650.277727openalex-snapshot
Run-time code generation and modal-ML
inferred← citeshttps://doi.org/10.1145/289121.289144openalex-snapshot
Dynamic specialization in the Fabius system
inferred← citeshttps://doi.org/10.1145/3011069openalex-snapshot
A Temporal Logic Approach to Binding-Time Analysis
inferred← citeshttps://doi.org/10.1145/301618.301681openalex-snapshot
Efficient incremental run-time specialization for free
inferred← citeshttps://doi.org/10.1145/328690.328697openalex-snapshot
A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival
inferred← citeshttps://doi.org/10.1145/328691.328697openalex-snapshot
A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival
inferred← citeshttps://doi.org/10.1145/331960.331975openalex-snapshot
DSL implementation using staging and monads
inferred← citeshttps://doi.org/10.1145/3707203openalex-snapshot
A Layered Approach to Intensional Analysis in Type Theory
inferred← citeshttps://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.1145/507635.507646openalex-snapshot
Macros as multi-stage computations
inferred← citeshttps://doi.org/10.1145/507669.507646openalex-snapshot
Macros as multi-stage computations
inferred← citeshttps://doi.org/10.1145/568173.568176openalex-snapshot
Search-based binding time analysis using type-directed pruning
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:8)2010openalex-snapshot
A Logical Foundation for Environment Classifiers
inferred← citeshttps://doi.org/10.4204/eptcs.71.3openalex-snapshot
Multi-level Contextual Type Theory
inferred← citeshttps://doi.org/10.5381/jot.2014.13.1.a1openalex-snapshot
Aspects for Stages: Cross Cutting Concerns for Metaprograms.
inferred← citeshttps://doi.org/10.5381/jot.2019.18.1.a1openalex-snapshot
Meta C++: an extension layer for multi-stage generative metaprogramming .
inferred← citeshttps://doi.org/10.6083/m4n877qfopenalex-snapshot
The role of type equality in meta-programming
inferred← citeshttps://doi.org/10.6083/m4td9vjbopenalex-snapshot
Multi-state programming : its theory and applications
inferred← citeshttps://doi.org/10.7146/brics.v3i34.20015openalex-snapshot
A Computational Formalization for Partial Evaluation (Extended Version)
inferred← citeshttps://doi.org/10.7146/dpb.v25i510.7039openalex-snapshot
Multi-Level Languages: a Descriptive Framework
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.