On the call-by-value CPS transform and its semantics

Research output: Contribution to journalArticle

Authors

Colleges, School and Institutes

Abstract

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.

Details

Original languageEnglish
Pages (from-to)241-283
Number of pages43
JournalInformation and Computation
Volume188
Issue number2
Publication statusPublished - 1 Jan 2004