On the public citation graph

Mechanically verifying the correctness of an offline partial evaluator

https://doi.org/10.1007/bfb0026826
0 signed · 37 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/3-540-51305-1_13openalex-snapshot
Deriving mixed evaluation from standard evaluation for a simple functional language
inferredcites →https://doi.org/10.1007/3-540-55602-8_190openalex-snapshot
Implementing the meta-theory of deductive systems
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-59293-8_218openalex-snapshot
Reasoning with executable specifications
inferredcites →https://doi.org/10.1007/3-540-59293-8_227openalex-snapshot
Formal specification and prototyping of a program specializer
inferredcites →https://doi.org/10.1007/bfb0013612openalex-snapshot
Natural semantics and some of its meta-theory in Elf
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796800000666openalex-snapshot
Extended natural semantics
inferredcites →https://doi.org/10.1017/s0956796800000770openalex-snapshot
Correctness of binding-time analysis
inferredcites →https://doi.org/10.1017/s0956796800000782openalex-snapshot
Specifying the correctness of binding-time analysis
inferredcites →https://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferredcites →https://doi.org/10.1109/lics.1992.185552openalex-snapshot
Compiler verification in LF
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferredcites →https://doi.org/10.1145/182409.182483openalex-snapshot
Continuation-based partial evaluation
inferredcites →https://doi.org/10.1145/199448.199485openalex-snapshot
Total correctness by local improvement in program transformation
inferredcites →https://doi.org/10.1145/53990.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.21236/ada256574openalex-snapshot
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
inferredcites →https://doi.org/10.21236/ada296537openalex-snapshot
A Modal Analysis of Staged Computation,
inferredcites →https://doi.org/10.5860/choice.30-5049openalex-snapshot
Semantics of programming languages: structures and techniques

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-47018-2_7openalex-snapshot
Partial Evaluation for the Lambda Calculus
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_20openalex-snapshot
PE-KeY: A Partial Evaluator for Java Programs
inferred← citeshttps://doi.org/10.1007/bfb0014551openalex-snapshot
Sound specialization in the presence of computational effects
inferred← citeshttps://doi.org/10.1007/bfb0026825openalex-snapshot
Efficient multi-level generating extensions for program specialization
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80148-3openalex-snapshot
Correctness of a Region-Based Binding-Time Analysis
inferred← citeshttps://doi.org/10.1017/s0956796802004586openalex-snapshot
Program specialization for execution monitoring
inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferred← citeshttps://doi.org/10.1023/a:1007763000430openalex-snapshot
inferred← citeshttps://doi.org/10.1109/lics.1996.561317openalex-snapshot
A temporal-logic approach to binding-time analysis
inferred← citeshttps://doi.org/10.1145/237721.237788openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.1145/2643135.2643146openalex-snapshot
A Type Theoretic Specification of Partial Evaluation
inferred← citeshttps://doi.org/10.1145/3011069openalex-snapshot
A Temporal Logic Approach to Binding-Time Analysis
inferred← citeshttps://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.7146/brics.v3i34.20015openalex-snapshot
A Computational Formalization for Partial Evaluation (Extended Version)
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.