scientific article; zbMATH DE number 18655
[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.
- The sequentially realizable functionals
- Game-theoretic analysis of call-by-value computation
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Comparing abstraction refinement algorithms
- scientific article; zbMATH DE number 194122 (Why is no real title available?)
- Fully abstract translations between functional languages
- scientific article; zbMATH DE number 1523049 (Why is no real title available?)
- Game theoretic analysis of call-by-value computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976061)