Call-By-Push-Value: A Subsuming Paradigm (1999)
Cached
Download Links
- [www.disi.unige.it]
- [www.dcs.qmw.ac.uk]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | in Proc. TLCA ’99 |
| Citations: | 14 - 0 self |
BibTeX
@INPROCEEDINGS{Levy99call-by-push-value:a,
author = {Paul Blain Levy},
title = {Call-By-Push-Value: A Subsuming Paradigm},
booktitle = {in Proc. TLCA ’99},
year = {1999},
pages = {228--242},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Call-by-push-value is a new paradigm that subsumes the call-by-name and call-by-value paradigms, in the following sense: both operational and denotational semantics for those paradigms can be seen as arising, via translations that we will provide, from similar semantics for call-by-push-value. To explain call-by-push-value, we first discuss general operational ideas, especially the distinction between values and computations, using the principle that "a value is, a computation does". Using an example program, we see that the lambda-calculus primitives can be understood as push/pop commands for an operand-stack. We provide operational and denotational semantics for a range of computational effects and show their agreement. We hence obtain semantics for call-by-name and call-by-value, of which some are familiar, some are new and some were known but previously appeared mysterious. 1 Introduction 1.1 Contribution In his invited lecture at POPL '98 [32], Reynolds, surveying over 30 year...
