A Logic of Sequentiality

  • Martin Churchill
  • James Laird
Conference paper

DOI: 10.1007/978-3-642-15205-4_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6247)
Cite this paper as:
Churchill M., Laird J. (2010) A Logic of Sequentiality. In: Dawar A., Veith H. (eds) Computer Science Logic. CSL 2010. Lecture Notes in Computer Science, vol 6247. Springer, Berlin, Heidelberg

Abstract

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 categorical 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.

Keywords

Game semantics sequentiality full completeness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Martin Churchill
    • 1
  • James Laird
    • 1
  1. 1.University of BathUnited Kingdom

Personalised recommendations