Games in the Semantics of Programming Languages (1997)
| Venue: | Dept. of Philosophy, University of Amsterdam |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Abramsky97gamesin,
author = {Samson Abramsky},
title = {Games in the Semantics of Programming Languages},
booktitle = {Dept. of Philosophy, University of Amsterdam},
year = {1997},
pages = {1--6}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ion for PCF Motivated by the full completeness results, it became of compelling interest to re-examine perhaps the best-known "open problem" in the semantics of programming languages, namely the "Full Abstraction problem for PCF", using the new tools provided by game semantics. 2 PCF is a higher-order functional programming language; modulo issues of the parameterpassing strategies, it forms a fragment of any programming language with higher-order procedures (which includes any reasonably expressive object-oriented language). The aspect of the Full Abstraction problem I personally found most interesting was: to construct a syntax-independent model in which every element is the denotation of some program (note the analogy with full completeness, whose definition had in turn been motivated in part by this aspect of full abstraction). This is not how the problem was originally formulated, but by "general abstract nonsense", given such a model one can always quotient it to get a fully ab...
