TY - JOUR
T1 - On the call-by-value CPS transform and its semantics
AU - Fuhrmann, C
AU - Thielecke, Hayo
PY - 2004/1/1
Y1 - 2004/1/1
N2 - We investigate continuations in the context of idealized call-by-value programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of call-by-value languages. On the syntactic side, we study the call-by-value continuation-pas sing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a delaying transform. (C) 2003 Elsevier Inc. All rights reserved.
AB - We investigate continuations in the context of idealized call-by-value programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of call-by-value languages. On the syntactic side, we study the call-by-value continuation-pas sing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a delaying transform. (C) 2003 Elsevier Inc. All rights reserved.
UR - http://www.scopus.com/inward/record.url?scp=0742303621&partnerID=8YFLogxK
U2 - 10.1016/j.ic.2003.08.001
DO - 10.1016/j.ic.2003.08.001
M3 - Article
VL - 188
SP - 241
EP - 283
JO - Information and Computation
JF - Information and Computation
IS - 2
ER -