On the public citation graph

Strong normalization by type-directed partial evaluation and run-time code generation

https://doi.org/10.1007/bfb0055521
0 signed · 39 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/10705424_16openalex-snapshot
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
inferredcites →https://doi.org/10.1007/3-540-61580-6openalex-snapshot
Partial Evaluation
inferredcites →https://doi.org/10.1007/3-540-61756-6_85openalex-snapshot
Semantics-based compiling: A case study in type-directed partial evaluation
inferredcites →https://doi.org/10.1007/bf01019004openalex-snapshot
The essence of eta-expansion in partial evaluation
inferredcites →https://doi.org/10.1007/bfb0037100openalex-snapshot
Program extraction from normalization proofs
inferredcites →https://doi.org/10.1007/bfb0049326openalex-snapshot
From semantics to rules: A machine assisted analysis
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferredcites →https://doi.org/10.1145/234528.234741openalex-snapshot
Resource-bounded partial evaluation
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/258915.258935openalex-snapshot
Two for the price of one
inferredcites →https://doi.org/10.1145/258993.258999openalex-snapshot
A type-directed, on-line, partial evaluator for a polymorphic language
inferredcites →https://doi.org/10.1145/258993.259017openalex-snapshot
Resource-bounded partial evaluation
inferredcites →https://doi.org/10.1145/800055.802036openalex-snapshot
Modules for standard ML
inferredcites →https://doi.org/10.1145/93542.93554openalex-snapshot
Representing control in the presence of first-class continuations
inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.1145/99583.99588openalex-snapshot
Static and dynamic semantics processing
inferredcites →https://doi.org/10.7146/brics.v5i1.19275openalex-snapshot
A Simple Solution to Type Specialization
inferredcites →https://doi.org/10.7146/brics.v5i9.19281openalex-snapshot
Encoding Types in ML-like Languages (Preliminary Version)

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-44806-3_8openalex-snapshot
Integrating Partial Evaluators into Interpreters
inferred← citeshttps://doi.org/10.1007/3-540-45587-6_9openalex-snapshot
Compiling Embedded Programs to Byte Code
inferred← citeshttps://doi.org/10.1007/3-540-45821-2_5openalex-snapshot
Memoization in Type-Directed Partial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_16openalex-snapshot
Type-Directed Partial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_16openalex-snapshot
Higher-Order Code Splicing
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_15openalex-snapshot
Two Flavors of Offine Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-45340-3_1openalex-snapshot
Total Functional Software Engineering
inferred← citeshttps://doi.org/10.1017/s0956796801004166openalex-snapshot
Normalization by evaluation with typed abstract syntax
inferred← citeshttps://doi.org/10.1145/1863543.1863587openalex-snapshot
Scrapping your inefficient engine
inferred← citeshttps://doi.org/10.1145/2364527.2364542openalex-snapshot
Painless programming combining reduction and search
inferred← citeshttps://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferred← citeshttps://doi.org/10.1145/2398856.2364542openalex-snapshot
Painless programming combining reduction and search
inferred← citeshttps://doi.org/10.1145/581478.581504openalex-snapshot
Final shift for call/cc:
inferred← citeshttps://doi.org/10.1145/964001.964007openalex-snapshot
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
inferred← citeshttps://doi.org/10.4230/lipics.types.2014.72openalex-snapshot
Typeful Normalization by Evaluation
inferred← citeshttps://doi.org/10.7146/aul.214.152openalex-snapshot
An Analytical Approach to Programs as Data Objects
inferred← citeshttps://doi.org/10.7146/brics.v5i1.19275openalex-snapshot
A Simple Solution to Type Specialization
inferred← citeshttps://doi.org/10.7146/brics.v8i16.20473openalex-snapshot
Normalization by Evaluation with Typed Abstract Syntax
inferred← citeshttps://doi.org/10.7146/brics.v9i33.21748openalex-snapshot
Memoization in Type-Directed Partial Evaluation
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.