Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424392 | Electronic Notes in Theoretical Computer Science | 2007 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics