Geodesic
Adjunction models for call-by-push-value with stacks
Theory and applications of categories, Tome 14 (2005), pp. 75-110.

Voir la notice de l'article provenant de la source Theory and Applications of Categories website

Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present its operational semantics as a stack machine, suggesting a term judgement of stacks. We then see that CBPV, incorporating these stack terms, has a simple categorical semantics based on an adjunction between values and stacks. There are no coherence requirements. We describe this semantics incrementally. First, we introduce locally indexed categories and the opGrothendieck construction, and use these to give the basic structure for interpreting the three judgements: values, stacks and computations. Then we look at the universal property required to interpret each type constructor. We define a model to be a strong adjunction with countable coproducts, countable products and exponentials. We see a wide range of instances of this structure: we give examples for divergence, storage, erratic choice, continuations, possible worlds and games (with or without a bracketing condition), in each case resolving the strong monad from the literature into a strong adjunction. And we give ways of constructing models from other models. Finally, we see that call-by-value and call-by-name are interpreted within the Kleisli and co-Kleisli parts, respectively, of a call-by-push-value adjunction.
Classification : 18C50
Keywords: call-by-push-value, adjunction, CK-machine, monad, denotational semantics, indexed category, continuations, possible worlds, game semantics, call-by-name, call-by-value 
@article{TAC_2005_14_a4,
     author = {Paul Blain Levy},
     title = {Adjunction models for call-by-push-value with stacks},
     journal = {Theory and applications of categories},
     pages = {75--110},
     publisher = {mathdoc},
     volume = {14},
     year = {2005},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/TAC_2005_14_a4/}
}
TY  - JOUR
AU  - Paul Blain Levy
TI  - Adjunction models for call-by-push-value with stacks
JO  - Theory and applications of categories
PY  - 2005
SP  - 75
EP  - 110
VL  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TAC_2005_14_a4/
LA  - en
ID  - TAC_2005_14_a4
ER  - 
%0 Journal Article
%A Paul Blain Levy
%T Adjunction models for call-by-push-value with stacks
%J Theory and applications of categories
%D 2005
%P 75-110
%V 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TAC_2005_14_a4/
%G en
%F TAC_2005_14_a4
Paul Blain Levy. Adjunction models for call-by-push-value with stacks. Theory and applications of categories, Tome 14 (2005), pp. 75-110. http://geodesic.mathdoc.fr/item/TAC_2005_14_a4/