No label defined (Q3976061)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 18655
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 18655

      Statements

      26 June 1992
      0 references
      models of programming languages
      0 references
      full abstraction
      0 references
      0 references
      [For the entire collection see Zbl 0731.00025.] The analogue of Plotkin's full abstraction theorem for a call-by-value version of PCF is proved in the first part of the paper. As the underlying model the author's variant of Plotkin's bottom-less cpo's and partial continuous functions are used. In the second part it is shown how the (known) full abstraction theorems for two other languages (lazy PCF and PCF with control facilities) can be obtained in a much simpler way - as corollaries of the theorem proved in the first part. The method avoids several technical difficulties met in original proofs.
      0 references

      Identifiers