Paper: Games and Full Abstraction for FPC (at LICS 1996)
Winner of the Kleene Award in 1996
Authors: Guy McCusker
Abstract
We present a new category of games, G, and build from it a cartesian closed category I and its extensional quotient E. E represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in E is described and shown to be fully abstract.
BibTeX
@InProceedings{McCusker-GamesandFullAbstrac, author = {Guy McCusker}, title = {Games and Full Abstraction for FPC}, booktitle = {Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS 1996)}, year = {1996}, month = {July}, pages = {174--183}, location = {New Brunswick, NJ, USA}, publisher = {IEEE Computer Society Press} }