[Prev][Next][Index][Thread]

workshop on Games, Processes and Logic






		     A Newton Institute Workshop

		      GAMES, PROCESSES and LOGIC
		  
			 6 - 10 November 1995
		   Newton Institute, Cambridge, UK

			Call for Registration

BACKGROUND 

The workshop will take place as part of the Newton Institute programme
on the Semantics of Computation. The general aims of the programme are
twofold. First, to refine the current framework for the semantics of
computation so that it is capable of dealing with the more subtle
computational features present in the programming languages of today
and tomorrow.  Secondly, to provide a framework for interaction
between such fundamental research and the issues confronted by
language designers and software engineers. We particularly have in
mind current developments such as object-based concurrent programming,
and projects to develop the next generation of advanced programming
languages, such as ML 2000.  The range of technical and conceptual
challenges involved in this work requires active collaboration and
flow of information between overlapping communities of mathematicians,
computer scientists and computer practitioners.


WORKSHOP PROGRAMME

Games
=====

There are long-standing connections between games and logic (e.g.
determinacy of games in Set theory, Ehrenfeucht-Fraisse  games in Model
theory, dialogue games in Proof theory, etc. etc.)
More recently, games have been applied to the semantics of computation,
in a variety of ways:

 - Games provide an intrinsic model of interaction, e.g. between a system
 and its environment, with processes modelled as strategies.
 This has led to refined models of various logics,  type theories and
 programming languages.

 - ``Abstract'' notions of games (Chu spaces, Dialectica categories)
   have been used to model Linear Logic, and a variety of computational
   situations.

 - Games can be used to  characterize notions of equivalence between
 processes, such as bisimulation; and to characterize provability
 in various logical systems.

 - Probabilistic games have been used to characterize complexity classes;
 these games have been related to provability in certain fragments of
 Linear logic.

 - Game  formalisms have been used in  proving decidability of a number
 of second-order systems.

 Processes
 =========

 The notion of  concurrent process can be seen as one of the few key 
 conceptual contributions of Computer Science with no evident precursor
 in Logic or Mathematics. As such, it sets new challenges for logical
 formalization. Apart from the extensive work on applying modal and temporal
 logic to concurrency, there is also much current activity on trying
 to combine process calculi with lambda-calculus and type theory in a
 unified setting. The modelling of imperative and functional features
 in combination, as in ML or ``Algol-like'' languages, is also very
 challenging.
 Milner's action calculi aim to provide a unifying formalism in a categorical
 framework; there are many other current approaches.


 The aim of the Workshop is to  bring together researchers pursuing these
 various strands, to compare and contrast the different approaches, and take
 stock of current progress and future directions.

 The following people have already agreed to speak at the Workshop:

 Martin Hyland (dialogue games, semantics of proofs and functional programs)
 Robin Milner (action structures)
 John Mitchell, Andre Scedrov (probabilistic games, IP and Linear Logic)
 Luke Ong (dialogue games and semantics of proofs in Classical logic)
 Vaughan Pratt (Chu spaces)
 Colin Stirling (games for bisimulation and  proof tableaux in modal 
		 mu-calculus)
 Philip Scott (process interpretations of Linear Logic)


The organizers invite offers of contributed talks. These will be
selected on the basis of submitted abstracts.  Abstracts in English
(up to 2 pages) should be sent (preferably by email) to

			Prof. Samson Abramsky (GPL)
			Department of Computing
			Imperial College
			180 Queen's Gate
			London SW7 2BZ

			email: sa@doc.ic.ac.uk

In addition to an indication of the results to be presented in the
talk and their relevance to the theme of the workshop, the abstract
should give the talk title and the speakers's name, address, telephone
number, fax number and email address (when available).


CONFERENCE LOCATION, COSTS AND REGISTRATION

The workshop will take place in the Newton Institute's
purpose-designed building, in a pleasant area in the west of
Cambridge, about one mile from the centre of the City. There will be a
registration fee of 40 pounds (includes the cost of lunches, coffee
and tea breaks). The Newton Institute can provide assistance with
finding local accommodation---the cost of which is likely to be 40
pounds per day including breakfast.

To register, please return the appended REGISTRATION FORM to:

                        Mike Sekulla
			Isacc Newton Institute
			20 Clarkson Road
			Cambridge CB3 0EH

			Tel: +44 1223 335984
			Fax: +44 1223 330508
			Email: M.F.Sekulla@newton.cam.ac.uk


For more information or further enquiries about the workshop contact:

                        Prof. Samson Abramsky <sa@doc.ic.ac.uk>


---------------------------------------------------------------------------

			  REGISTRATION FORM

		 [Return to M.F.Sekulla@newton.cam.ac.uk]

	    

	      Newton Institute for Mathematical Sciences
			     Workshop on
		 
	             GAMES, PROCESSES and LOGIC	

			   6 - 10 November 1995
			  

Name:

Organization:

Address:

Telephone:

Fax:

Email:

Accomodation needed?  

If yes, which nights [5, 6, 7, 8, 9, 10 recommended]?

   Sunday 5 
   Monday 6 
   Tuesday 7 
   Wednesday 8 
   Thursday 9 
   Friday 10 

Offering contributed talk?
[If yes, send abstract direct to sa@doc.ic.ac.uk]
  
----------------------------------------------------------------------