A Logic of Sequentiality [chapter]

Martin Churchill, James Laird
2010 Lecture Notes in Computer Science  
Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with "history-sensitive" behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs in a new kind of affine logic. We describe the semantics of our logic formally by giving a notion of
more » ... ategorical model and an instance based on a simple category of games. Using further categorical properties of this model, we prove a full completeness result: each total strategy is the semantics of a unique cut-free core proof in the system. We then use this result to derive an explicit cut-elimination procedure.
doi:10.1007/978-3-642-15205-4_19 fatcat:6q55s6nrtvdorjei5tfb6fyqgm