Full Abstraction and the Context Lemma 1

Jim, Trevor; Meyer, Albert R.

Full Abstraction and the Context Lemma 1

Download

Name

MIT-LCS-TR-524.pdf

Size

3.88 MB

Format

Adobe PDF

Checksum (MD5)

f55a4097296fc7b7b777d1c14de6008f

Author(s)

Jim, Trevor

•

Meyer, Albert R.

Date Issued

December 1991

Series/Report no.

MIT-LCS-TR-524

Abstract

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.

Persistent DSpace Link

https://hdl.handle.net/1721.1/149717