Sciweavers

3 search results - page 1 / 1
» Stable Bistructure Models of PCF
Sort
View
IANDC
2006
78views more  IANDC 2006»
13 years 5 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
APAL
2002
73views more  APAL 2002»
13 years 5 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley