Definability and full abstraction
by
Pierre-Louis Curien
| Venue: | GDP FESTSCHRIFT |
| Citations: | 16 - 2 self |
BibTeX
@MISC{Curien_definabilityand,
author = {Pierre-Louis Curien},
title = {Definability and full abstraction},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, several full completeness results have been shown since the early nineties. In this note, we review the relation between definability and full abstraction, and we put a few old and recent results of this kind in perspective.
