Abstract | ||
---|---|---|
The Continuation-Passing-Style (CPS) translation gives semantics to control operators such as exception and first-class continuations. By iterating this translation, Danvy and Filinski obtained a CPS hierarchy, and used it to specify a series of control operators, hierarchical (or layered) delimited-control operators. We introduce a call-by-name variant of the CPS hierarchy. While most of the work on delimited-control operators is based on call-by-value calculi, call-by-name delimited-control operators are an active target of recent studies. Our strategy for developing such a hierarchy is to use the results for the call-by-value calculi as much as possible. The key tool is Hatcliff and Danvy's factorization of Plotkin's call-by-name CPS translation into a thunk translation and a call-by-value CPS translation. We show that a call-by-name CPS hierarchy can be obtained by naturally extending the factorization to the calculi with control operators, and then prove several properties for this hierarchy. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-29822-6_21 | FLOPS |
Keywords | Field | DocType |
call-by-name cps hierarchy,call-by-name cps translation,call-by-value cps translation,call-by-name variant,call-by-name delimited-control operator,cps hierarchy,delimited-control operator,call-by-value calculus,control operator,thunk translation | Evaluation strategy,Thunk,Computer science,Algorithm,Theoretical computer science,A-normal form,Factorization,Operator (computer programming),Hierarchy,Semantics,Equational theory | Conference |
Volume | ISSN | Citations |
7294 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 17 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Asami Tanaka | 1 | 3 | 1.05 |
Yukiyoshi Kameyama | 2 | 171 | 17.29 |