Download the complete article:

@article{paolini06iandc,
  number = {3},
  volume = {204},
  issn = {0890-5401},
  author = {Paolini, Luca},
  note = {Elsevier, Netherlands},
  url = {http://www.sciencedirect.com/science?\_ob=ArticleURL&\_udi=B6WGK-4J0XV83-1&_coverDate=01%2F10%2F2006&_alid=353775876&_rdoc=1&_fmt=&_orig=search&_qd=1&_cdi=6825&_sort=d&view=c&_acct=C000026382&_version=1&_urlVersion=0&_userid=525216&md5=f2b18985274c844ea88e6029298513fd},
  tag = {Information and Computation},
  abstract = {It is well-known that stable models (as dI-domains, qualitative
              domains and coherence spaces) 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 models is filled, consequently stable models are fully
              abstract for the extended language.},
  title = {A Stable Programming Language},
  localfile = {http://www.di.unito.it/~paolini/papers/stpcf.pdf},
  pages = {339-375},
  journal = {Information and Computation},
  year = 2006,
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)