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

Alexander Rohr

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

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

Theory of computation · 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%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › program equivalence
full abstraction		 0.011999
Full Abstraction and Universality via Realisability · LICS 1999
Programming languages and type systems
lambda calculus		 0.011999
Full Abstraction and Universality via Realisability · LICS 1999
Programming languages and type systems
language semantics		 0.011999
Full Abstraction and Universality via Realisability · LICS 1999
Programming languages and type systems › lambda calculus
PCF		 0.011999
Full Abstraction and Universality via Realisability · LICS 1999

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

realisability · 0.0logical relations · 0.0
YearPublicationVenuePosition
1999 Full Abstraction and Universality via Realisability
abstract
We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley-Phoa Conjecture by showing that the realisability model over an untyped /spl lambda/-calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for SFPL.
Michael Marz, Alexander Rohr, Thomas Streicher
 LICS2