A relative PCF-definability result for strongly stable functions and some corollaries (Extended abstract)
Thomas Ehrhard · Electronic Notes in Theoretical Computer Science · 2000
We prove that, in the hierarchy of simple types based on the type of natural numbers, any finite strongly stable function is equal to the application of the semantics of a PCF-definable functional to some strongly stable (generally not PCF-definable) functionals of type two. Applying a logical relation technique, we derive from this result that the strongly stable model of PCF is the extensional collapse of its sequential algorithms model.