Contributions offered by Thomas Streicher for topics 
F (games, sequentiality, and abstract machines)

Based on work of Riecke and Sandholm (1996) we construct a 
category SD of Sequential Domains allowing for all the domain 
constructors as considered e.g. in Plotkin's Domain Notes.
We analyse the extensional collapse of an arbitrary intensional 
fully abstract model G (of PCF) by studying the relation to the 
fully abstract model F in SD. 
This logical relation can be understood as a typed version 
of realisability.
Solving the domain equation 
$A \cong N_{\bot} \oplus [A \rightarrow A]$ in SD
gives rise to a partial combinatory algebra A such that
the realisability model of PCF in Mod(A) is isomorphic to
the fully abstract model F of PCF in SD.
Relations to the work of Abramsky & Longley and Nickau & Ong 
are discussed whose intention is to reconstruct the fully 
abstract model as a realisability model albeit over a more
``intensional'' pca of game-theoretic nature.

--------------------------------------------------------------
Result of feedback form submitted by
Streicher (streicher@mathematik.tu-darmstadt.de) on Monday, July 20, 1998 at 15:21:0