Full Abstraction and the Context Lemma 1
| dc.contributor.author | Jim, Trevor | en_US |
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.date.accessioned | 2023-03-29T15:18:26Z | |
| dc.date.available | 2023-03-29T15:18:26Z | |
| dc.date.issued | 1991-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149717 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-524 | |
| dc.title | Full Abstraction and the Context Lemma 1 | en_US |
| dc.identifier.oclc | 25854778 |
