Full Abstraction and the Context Lemma 1
It is impossible to add a combinator to PCF to achieve full abstraction for models such as Berry's stable domains in a way analogous to the addition of the "parallel-or" combinator that achieves full abstraction for the familiar cpo model.
Main Authors: | Jim, Trevor, Meyer, Albert R. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149717 |
Similar Items
-
A four-flagged lemma
by: Sertel, Murat R.
Published: (2009) -
Removal lemmas and approximate homomorphisms
by: Fox, Jacob, et al.
Published: (2022) -
On Kuhn's strong cubical lemma
by: Freund, Robert Michael.
Published: (2009) -
Regularity and removal lemmas and their applications
by: Lovász, László Miklós
Published: (2017) -
Lemma Neyman-Pearson dan Penggunaannya
by: , Subanar
Published: (1976)