Title :
Games and full abstraction for FPC
Author_Institution :
Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK
Abstract :
We present a new category of games, 𝒢, and build from it a cartesian closed category I and its extensional quotient ε. ε 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 ε is described and shown to be fully abstract
Keywords :
category theory; computational linguistics; game theory; programming theory; type theory; FPC; cartesian closed category; category of games; denotational semantics; extensional quotient; full abstraction; function spaces; recursive types; Calculus; Computer languages; Flexible printed circuits; Game theory;
Conference_Titel :
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location :
New Brunswick, NJ
Print_ISBN :
0-8186-7463-6
DOI :
10.1109/LICS.1996.561316
