Elsevier

Information and Computation

Volume 179, Issue 2, 15 December 2002, Pages 296-331
Information and Computation

Regular Article
A Relational Account of Call-by-Value Sequentiality☆

https://doi.org/10.1006/inco.2002.2957Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

☆

A preliminary version of this paper appeared in Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 258–267. IEEE Computer Society Press, 1997.

2

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

Copyright © 2002 Elsevier Science (USA). All rights reserved.