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 parallel functions and of stable functions that are not monotone with respect to the extensional order, which cannot be defined by programs of PCF. In this paper, a paradigmatic programming language named StPCF is proposed, which extends the language PCF 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 StPCF can define all finite cliques of coherence spaces the above gap with stable s filled, consequently stable models are fully abstract for the extended language.

• Type: Journal
• Year: 2006
• Where: IANDC
• Authors: Luca Paolini
• Keywords: IANDC 2006, Language Pcf, Stable, Stable Models