Heriot-Watt University, Edinburgh
10-13 April 1999
University of Edinburgh
Concurrent Games and Full Completeness for Linear Logic
Game semantics has emerged as a powerful paradigm for giving semantics
to a variety of logical
systems and programming languages. It has been used to prove full
completeness results -
completeness at the level of proofs, not merely provability - and to
give the first
syntax-independent constructions of fully abstract models for a spectrum
of programming
languages ranging from purely functional languages to languages with
non-functional features
such as control operators and references. There are also applications to
the semantics of
branching quantifiers and ``independence-friendly'' logics, which have
connections to the
semantics of natural language.
In this talk we will present a concurrent games model of Linear Logic,
and a full completeness result will be described.
Maintained by
Fairouz Kamareddine
(
)