充分的抽象和普遍性通过可实现性

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI:10.1109/LICS.1999.782612

Michael Marz, Alexander Rohr, T. Streicher

{"title":"充分的抽象和普遍性通过可实现性","authors":"Michael Marz, Alexander Rohr, T. Streicher","doi":"10.1109/LICS.1999.782612","DOIUrl":null,"url":null,"abstract":"We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley-Phoa Conjecture by showing that the realisability model over an untyped /spl lambda/-calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for SFPL.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Full abstraction and universality via realisability\",\"authors\":\"Michael Marz, Alexander Rohr, T. Streicher\",\"doi\":\"10.1109/LICS.1999.782612\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley-Phoa Conjecture by showing that the realisability model over an untyped /spl lambda/-calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for SFPL.\",\"PeriodicalId\":352531,\"journal\":{\"name\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1999.782612\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1999.782612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

我们构造了PCF的全抽象可实现模型。特别地，我们证明了Longley-Phoa猜想的一个变体，证明了在带算术的非类型化/spl λ /-微积分上的可实现性模型对于PCF是完全抽象的。进一步，我们考虑将我们的结果扩展到通用顺序函数式编程语言SFPL，从而产生SFPL的通用可实现模型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Full abstraction and universality via realisability

We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley-Phoa Conjecture by showing that the realisability model over an untyped /spl lambda/-calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for SFPL.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)

自引率

0.00%

发文量