AbstractGame 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
AbstractWe present a denotational semantics for an Algol-like language Alg, which is fully abstract ...
Formal description of a language gives insight into the language itself. The formal description may ...
AbstractWe construct a hierarchy of semantics by successive abstract interpretations. Starting from ...
AbstractGame semantics has renewed denotational semantics. It offers among other things an attractiv...
We introduce the concept of logical full abstraction, generalising the usual equational notion. We ...
ion for PCF Motivated by the full completeness results, it became of compelling interest to re-exam...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
AbstractA new category of games is developed which improves over existing such categories in that it...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
AbstractWe present an order-extensional, order (or inequationally) fully abstract model for Scott's ...
AbstractAn intensional model for the programming language PCF is described in which the types of PCF...
Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, ask...
AbstractWe consider issues related to the expressive power of the programming language FP. In partic...
Codatatypes are absent from many programming languages and proof assistants. We make a case for thei...
AbstractWe present a denotational semantics for an Algol-like language Alg, which is fully abstract ...
Formal description of a language gives insight into the language itself. The formal description may ...
AbstractWe construct a hierarchy of semantics by successive abstract interpretations. Starting from ...
AbstractGame semantics has renewed denotational semantics. It offers among other things an attractiv...
We introduce the concept of logical full abstraction, generalising the usual equational notion. We ...
ion for PCF Motivated by the full completeness results, it became of compelling interest to re-exam...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
AbstractA new category of games is developed which improves over existing such categories in that it...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
AbstractWe present an order-extensional, order (or inequationally) fully abstract model for Scott's ...
AbstractAn intensional model for the programming language PCF is described in which the types of PCF...
Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, ask...
AbstractWe consider issues related to the expressive power of the programming language FP. In partic...
Codatatypes are absent from many programming languages and proof assistants. We make a case for thei...
AbstractWe present a denotational semantics for an Algol-like language Alg, which is fully abstract ...
Formal description of a language gives insight into the language itself. The formal description may ...
AbstractWe construct a hierarchy of semantics by successive abstract interpretations. Starting from ...
DOI
Add to ORKG