Polarized games


To appear at Symposium on Logic in Computer Science (LICS'2002), Copenhagen, Denmark, July 22nd - 25th, 2002


We generalize the intuitionistic Hyland-Ong games to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding a game model for polarized linear logic with a definability result. As a consequence this gives a complete game model for various classical systems: LC, lambda-mu calculus, ... for both call-by-name and call-by-value evaluations.

Server START Conference Manager
Update Time 15 Mar 2002 at 15:30:30
Maintainer lics02@dcs.ed.ac.uk.
Start Conference Manager
Conference Systems