 |
|
|
W10
A Tutorial Workshop on Realizability SemanticsJune 30 -
July 1, 1999 - Room 3-L |
|
|
It seems to the organizers that there has been recently a reawaking of interest in many
aspects of realizability interpretations -- especially as regards type systems for
programming language semantics of for constructive reasoning. But, the details of
realizability can be quite technical, and so the aim of the workshop is to have several
tutorial lectures on history, basic definitions and results, recent applications,
connections to category theory, and then leave room for contributed workshop-style
research talks (of 30 minutes each). The workshop will last two days, and we may need one
evening session or a poster session.
Aside from the topics mentioned above, we wish to solicit contributions on such topics as:
Recursive Definitions of Types, Connections with Synthetic/Axiomatic Domain Theory,
Applications to Normalization, Modal Logics, Logical Relations, Uses for Specification,
Problems of Automating Deduction, and Extraction of Algorithms. Reports on work in
progress are encouraged.
An official call for papers will be distributed early in October along with a listing of
the scheduled tutorial lectures. We also expect that there will be a good possibility of
reproducing in print after the workshop - perhaps as a special issue of an appropriate
journal - the tutorials and the major results presented during the workshop.
Link to
the temporary W10 website
Topics
Program
Organizers
Accepted
Papers
Preliminary List of Tutorial Presentations
Registration
|
|
|
|
|
 |
