Eugene E. Kohlbecker

dblp:71/5682 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

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

Theory of computation · 2Software 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
2 papers
Programming languages and type systems · 69% Compilers and program optimization · 31%
Theoretical computer science
1 paper
Logic in computer science · 50% Mathematical optimization · 50%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › compiler construction
compiler generation
0.011987
Macro-by-Example: Deriving Syntactic Transformations from their Specifications · POPL 1987
Programming languages and type systems › language semantics
formal semantics
0.011987
Macro-by-Example: Deriving Syntactic Transformations from their Specifications · POPL 1987
Programming languages and type systems › metaprogramming
macros
0.011987
Macro-by-Example: Deriving Syntactic Transformations from their Specifications · POPL 1987
Mathematical optimization › iterative methods
continuation method
0.011986
Reasoning with Continuations · LICS 1986
Logic in computer science
lambda calculus
0.011986
Reasoning with Continuations · LICS 1986
Programming languages and type systems
control operators
0.011986
Reasoning with Continuations · LICS 1986

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

continuations · 0.0
YearPublicationVenuePosition
1987 Macro-by-Example: Deriving Syntactic Transformations from their Specifications
abstract
This paper presents two new developments. First, it describes a “macro-by-example” specification language for syntactic abstractions in Lisp and related languages. This specification language allows a more declarative specification of macros than conventional macro facilities do by giving a better treatment of iteration and mapping constructs. Second, it gives a formal semantics for the language and a derivation of a compiler from the semantics. This derivation is a practical application of semantics-directed compiler development methodology.
Eugene E. Kohlbecker, Mitchell Wand
POPL1
1987 A Syntactic Theory of Sequential Control
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba
Theor. Comput. Sci.3
1986 Reasoning with Continuations
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba
LICS3