Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Niels H. Christensen

dblp:20/3257 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 88% Programming languages and type systems · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › partial evaluation
offline partial evaluation
0.012004
Offline partial evaluation can be as accurate as online partial evaluation · ACM Trans. Program. Lang. Syst. 2004
Compilers and program optimization
partial evaluation
0.012004
Offline partial evaluation can be as accurate as online partial evaluation · ACM Trans. Program. Lang. Syst. 2004
Compilers and program optimization › partial evaluation
binding-time analysis
0.012004
Offline partial evaluation can be as accurate as online partial evaluation · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems
language semantics
0.012004
Offline partial evaluation can be as accurate as online partial evaluation · ACM Trans. Program. Lang. Syst. 2004

Methods — techniques the papers use, named apart from their topics

polyvariant specialization · 0.0constant propagation · 0.0
YearPublicationVenuePosition
2004 Offline partial evaluation can be as accurate as online partial evaluation
abstract
We show that the accuracy of online partial evaluation, or polyvariant specialization based on constant propagation, can be simulated by offline partial evaluation using a maximally polyvariant binding-time analysis. We point out that, while their accuracy is the same, online partial evaluation offers better opportunities for powerful generalization strategies. Our results are presented using a flowchart language with recursive procedures.
Niels H. Christensen, Robert Glück
ACM Trans. Program. Lang. Syst.1