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

Eric E. Schmidt

dblp:10/2128 · 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 · 87% Operating systems · 13%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems
polymorphism		 0.011983
Practical Use of a Polymorphic Applicative Language · POPL 1983
Programming languages and type systems
type checking		 0.011983
Practical Use of a Polymorphic Applicative Language · POPL 1983
Operating systems › system administration
system configuration		 0.011983
Practical Use of a Polymorphic Applicative Language · POPL 1983

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

lambda abstraction · 0.0hierarchical naming · 0.0
YearPublicationVenuePosition
1983 Practical Use of a Polymorphic Applicative Language
abstract
Assembling a large system from its component elements is not a simple task. An adequate notation for specifying this task must reflect the system structure, accommodate many configurations of the system and many versions as it develops, and be a suitable input to the many tools that support software development. The language described here applies the ideas of λ-abstraction, hierarchical naming and type-checking to this problem. Some preliminary experience with its use is also given.
Butler W. Lampson, Eric E. Schmidt
 POPL2