A stable programming language

It is well-known that stable models (as dI-domains, qualitative domains and coherence spaces) are not fully abstract for the language P CF. This fact is related to the existence of stable parallel functions and of stable functions that are not monotone with respect to the extensional order, which cannot be defined by programs of P CF. In this paper, a paradigmatic programming language named StP CF is proposed, which extends the language P CF with two additional operators. The operational description of the extended language is presented in an effective way, although the evaluation of one of the new operators cannot be formalized in a PCF-like rewrite system. Since StP CF can define all finite cliques of coherence spaces the above gap with stable models is filled, consequently stable models are fully abstract for the extended language.

Authors

• Luca Paolini

Keywords

No keywords are indexed for this paper.