Contributions offered by John Longley for topic
F (games, sequentiality, and abstract machines)

REALIZABILITY MODELS FOR SEQUENTIAL COMPUTATION

Over the past two years, several people (e.g. Abramsky, Longley,
Nickau, Ong, van Oosten, Streicher) have constructed partial
combinatory algebra giving rise to realizability models that
embody (various notions of) sequential computation. I will give
a brief overview of these developments and of the state-of-the-art
in this area.

---------------------------------------------------------------------------
result of feedback form submitted by
LONGLEY (jrl@dcs.ed.ac.uk) on Wednesday, August 12, 1998 at 12:06:35