A Relational Account of Call-by-Value Sequentially

Authors:
Jon G. Riecke;Anders Sandholm
Affiliations:
-;-
Venue:
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Year:
1997

Citing 0
Cited 5

From Algol to polymorphic linear lambda-calculus

Journal of the ACM (JACM)
Prelogical relations

Information and Computation
Lambda Definability with Sums via Grothendieck Logical Relations

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A fully abstract bidomain model of unary FPC

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Relational semantics for higher-order programs

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

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.