Games and Full Abstraction for FPC (0)
Cached
Download Links
- [users.comlab.ox.ac.uk]
- [www.cogs.susx.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science |
| Citations: | 17 - 3 self |
BibTeX
@INPROCEEDINGS{Mccusker_gamesand,
author = {Guy Mccusker and St. John's College},
title = {Games and Full Abstraction for FPC},
booktitle = {In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science},
year = {},
pages = {174--183},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ion for FPC Guy McCusker St. John's College, Oxford, United Kingdom OX1 3JP. email: mccusker@comlab.ox.ac.uk Abstract A new category of games is developed which improves over existing such categories in that it interprets sums as well as products, function spaces and recursive types. A model of FPC , a sequential functional language with just this type structure, is described and shown to be fully abstract. 1 Introduction Since the 1970s, denotational semantics has been used to model, reason about and describe programming languages. Typically, for a given language L, there is an understood class of observable properties that we are interested in. This gives rise to an observational preorder @ ¸ on the language, where for programs M and N the assertion M @ ¸ N means that every observable property of M is also satisfied by N . Denotational semantics models a program M as a mathematical object [[M ]] (usually some kind of function), and there is an order in the model, written as...
Citations
No citations identified.
