Full Abstraction, Totality and PCF (1997)
Cached
Download Links
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Math. Structures Comput. Sci |
| Citations: | 7 - 1 self |
BibTeX
@ARTICLE{Plotkin97fullabstraction,,
author = {Gordon Plotkin},
title = {Full Abstraction, Totality and PCF},
journal = {Math. Structures Comput. Sci},
year = {1997},
volume = {9}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ion, Totality and PCF Gordon Plotkin Abstract Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott's model of cpos and continuous functions if one restricts to total programs and total observations. The answer is negative, as there are distinct operational and denotational notions of totality. However, when two terms are each total in both senses then they are totally equivalent operationally iff they are totally equivalent in the Scott model. Analysing further, we consider sequential and parallel versions of PCF and several models: Scott's model of continuous functions, Milner's fully abstract model of PCF and their effective submodels. We investigate how totality differs between these models. Some apparently rather difficult open problems arise, essentially concerning whether the sequential and parallel versions of PCF have the same expressive power, in the sense of total equivale...
