Luca Paolini
A
stable programmming language
To appear in Information and Computation, 2005
It is well-known that stable functions
do not produce a fully abstract model with respect to the usual operational semantics of PCF.
This fact is related to the existence of stable ``parallel'' functions
and to the existence of some stable functions not monotone with respect to the extensional order,
which cannot be represented by programs of PCF.
In this paper, it is proposed an extension of PCF with two additional operators
already appeared in literature, for which a constructive ``operational description'' is formalized.
It is proved that this extension is
complete for defining the finite elements of stable model.
Hence, it follows that stable model is fully abstract model for the extended language.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43