# A Relational Account of Call-by-Value Sequentiality

Jon G. Riecke, Bell Laboratories, Lucent Technologies LFCS Theory Seminar Room 2511, JCMB, King's Buildings 11.00, Friday 30th May 1997

I will give a model construction for FPC, a purely functional, sequential, call-by-value language with a unit base type, functions, products, categorical sums, and recursive types. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. These relations tease apart the structure of Sieber's relations for PCF. I will prove that the model is fully abstract, and show how to use the model to prove that certain "parallel" functions are not programmable in FPC. This is joint work with Anders Sandholm of Aarhus University.