A relational account of call-by-value sequentiality

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-11 DOI:10.1109/LICS.1997.614953

J. Riecke, Anders Sandholm

引用次数: 36

Abstract

We construct a model for FPC, a purely functional, sequential, call-by-value language. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. We prove that the model is fully abstract.

查看原文本刊更多论文

按值调用顺序的关系描述

我们为FPC构建了一个模型，FPC是一种纯功能的、顺序的、按值调用的语言。该模型由部分连续函数建立，以Plotkin的形式，进一步约束为关于一类逻辑关系的一致。证明了该模型是完全抽象的。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量