Enno Folkerts

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

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

Theory of computation · 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%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
lambda calculus
0.011998
Invertibility in lambda-eta · LICS 1998
Logic in computer science › model theory
term model
0.011998
Invertibility in lambda-eta · LICS 1998

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

insolvable terms · 0.0
YearPublicationVenuePosition
1998 Invertibility in lambda-eta
abstract
This paper investigates invertibility properties of subjective and bijective terms in the closed term model of /spl lambda//spl eta/. With the help of insolvable terms, it will be shown that some special subjective terms are right-invertible and that all bijective terms are invertible.
Enno Folkerts
LICS1