A stable programming language
Saved in:
| Title: | A stable programming language |
|---|---|
| Authors: | Paolini, Luca1 paolini@di.unito.it |
| Source: | Information & Computation. Mar2006, Vol. 204 Issue 3, p339-375. 37p. |
| Subjects: | Programming languages, Extended ML (Computer program language), Electronic data processing, Artificial languages |
| Abstract: | Abstract: It is well-known that stable models (as dI-domains, qualitative domains and coherence spaces) are not fully abstract for the language . 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 . In this paper, a paradigmatic programming language named is proposed, which extends the language 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 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. [Copyright &y& Elsevier] |
| Copyright of Information & Computation is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
