Abstract

Following Scott, the denotational semantics of programming languages are usually built from the notion of continuous functions. The need for restricted models has been emphasized by Plotkin and Milner, which showed thats continuous function models did not capture all operational properties of ALGOL-like sequential languages. We present new model constructions from a notion of stable function. This requires the introduction of two different orderings between stable functions which give very different cpo structures to the function spaces. We show that Milner's fully abstract model of Plotkin's PCP language only contains stable functions.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.