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

Heinz Schlütter

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

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

Software engineering, systems software and programming languages · 1

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
functional programming
0.011983
Petri Net Models for the Evaluation of Applicative Programs Based on lambda-Expressions · IEEE Trans. Software Eng. 1983
Performance modeling and evaluation
petri net modeling
0.011983
Petri Net Models for the Evaluation of Applicative Programs Based on lambda-Expressions · IEEE Trans. Software Eng. 1983

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

petri nets · 0.0lambda calculus · 0.0
YearPublicationVenuePosition
1983 Petri Net Models for the Evaluation of Applicative Programs Based on lambda-Expressions
abstract
In applicative systems, program design is based on elementary constructs of the form apply function to argument(s), also called applications, which are to be recursively inserted into each other. Program evaluation follows a process of meaning-preserving transformations which systematically distributes argument expressions within function expressions and substitutes applications of primitive functions by their values, until a constant expression representing the result of the computation with respect to these transformations is being reached.
Werner E. Kluge, Heinz Schlütter
IEEE Trans. Software Eng.2