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.
EDBT 2026 Demo / reviewers in the wild / expert

D. L. Overheu

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

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

Applied, interdisciplinary, general and emerging computing · 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
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language implementation
abstract machines		 0.011966
An Abstract Machine for Symbolic Computation · J. ACM 1966
Programming languages and type systems
functional language		 0.011966
An Abstract Machine for Symbolic Computation · J. ACM 1966

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

list processing · 0.0FORTRAN simulator · 0.0
YearPublicationVenuePosition
1966 An Abstract Machine for Symbolic Computation
abstract
The design of an abstract machine with a recursive function programming language which avoids the predicate type of conditional is described. It is shown that trough the adoption of list processing techniques it has been possible to construct a simple simulator for the machine in FORTRAN. A program for the machine which causes it to perform symbolic differentiation with some algebraic manipulation of the expressions concerned is given as an example of the type of computations which may be performed.
D. L. Overheu
 J. ACM1