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

Anders Haraldsson

dblp:82/349 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1978
—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 · 87% Programming languages and type systems · 13%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
partial evaluation
0.011978
A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp · POPL 1978
Compilers and program optimization
program transformation
0.011978
A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp · POPL 1978
Programming languages and type systems › functional programming
lisp
0.011978
A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp · POPL 1978

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

partial evaluation · 0.0
YearPublicationVenuePosition
1978 A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp
abstract
A partial evaluation program for LISP is described, and an application where it has been used. The partial evaluator performs a number of other, related operations such as opening of functions and certain optimizations on programs. The application is based on the fact that we can generate from an interpreter and a partial evaluator the same object code as a corresponding compiler should do. The paper will first formally describe the relationship between an interpreter and a compiler through partial evaluation. The partial evaluator system is then briefly described and finally an experiment is shown where an interpreter for the iterative statement in INTERLISP is partially evaluated.
Anders Haraldsson
POPL1