Imperative programs as proofs via game semantics

Martin Churchill, James Laird, Guy McCusker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)
124 Downloads (Pure)

Abstract

Game semantics extends the Curry-Howard isomorphism to a three-way correspondence: proofs, programs, strategies. But the universe of strategies goes beyond intuitionistic logics and lambda calculus, to capture stateful programs. In this paper we describe a logical counterpart to this extension, in which proofs denote such strategies. We can embed intuitionistic first-order linear logic into this system, as well as an imperative total programming language. The logic makes explicit use of the fact that in the game semantics the exponential can be expressed as a final co algebra. We establish a full completeness theorem for our logic, showing that every bounded strategy is the denotation of a proof.
Original languageEnglish
Title of host publication26th Annual IEEE Symposium on Logic in Computer Science (LICS) 2011
PublisherIEEE
Pages65-74
Number of pages10
ISBN (Electronic)9780769544120
ISBN (Print)9781457704512
DOIs
Publication statusPublished - 2011
Event26th Annual IEEE Symposium on Logic in Computer Science - Toronto, ON, Canada
Duration: 21 Jun 201124 Jun 2011

Publication series

NameAnnual Symposium on Logic in Computer Science
PublisherIEEE
ISSN (Print)1043-6871

Conference

Conference26th Annual IEEE Symposium on Logic in Computer Science
Abbreviated titleLICS 2011
CountryCanada
CityToronto, ON
Period21/06/1124/06/11

Fingerprint Dive into the research topics of 'Imperative programs as proofs via game semantics'. Together they form a unique fingerprint.

Cite this