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.

Bibliographic Details
Main Authors: Jim, Trevor, Meyer, Albert R.
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149717
_version_ 1826204159654756352
author Jim, Trevor
Meyer, Albert R.
author_facet Jim, Trevor
Meyer, Albert R.
author_sort Jim, Trevor
collection MIT
description 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.
first_indexed 2024-09-23T12:49:50Z
id mit-1721.1/149717
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T12:49:50Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1497172023-03-30T03:42:57Z Full Abstraction and the Context Lemma 1 Jim, Trevor Meyer, Albert R. 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. 2023-03-29T15:18:26Z 2023-03-29T15:18:26Z 1991-12 https://hdl.handle.net/1721.1/149717 25854778 MIT-LCS-TR-524 application/pdf
spellingShingle Jim, Trevor
Meyer, Albert R.
Full Abstraction and the Context Lemma 1
title Full Abstraction and the Context Lemma 1
title_full Full Abstraction and the Context Lemma 1
title_fullStr Full Abstraction and the Context Lemma 1
title_full_unstemmed Full Abstraction and the Context Lemma 1
title_short Full Abstraction and the Context Lemma 1
title_sort full abstraction and the context lemma 1
url https://hdl.handle.net/1721.1/149717
work_keys_str_mv AT jimtrevor fullabstractionandthecontextlemma1
AT meyeralbertr fullabstractionandthecontextlemma1