DocumentCode
3298030
Title
A relational account of call-by-value sequentiality
Author
Riecke, Jon G. ; Sandholm, Anders
Author_Institution
Bell Labs., Lucent Technol., Murray Hill, NJ, USA
fYear
1997
fDate
29 Jun-2 Jul 1997
Firstpage
258
Lastpage
267
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
Keywords
formal languages; functional languages; FPC; call-by-value language; call-by-value sequentiality; fully abstract; partial continuous functions; Calculus; Computer science; Flexible printed circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1997. LICS '97. Proceedings., 12th Annual IEEE Symposium on
Conference_Location
Warsaw
ISSN
1043-6871
Print_ISBN
0-8186-7925-5
Type
conf
DOI
10.1109/LICS.1997.614953
Filename
614953
Link To Document