Games and Full Abstraction for FPC

  • Authors:
  • Guy McCusker

  • Affiliations:
  • -

  • Venue:
  • LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

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.