Abstract

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.

Citations

174	On full abstraction for pcf - Hyland, Ong - 2000
130	Abstract Syntax and Variable Binding - Fiore - 1999
126	The Duality of Computation - Curien, Herbelin - 2000
105	G.: A fully abstract game semantics for general references - Abramsky, Honda, et al. - 1998
103	Weakly Distributive Categories, in - Cockett, Seely - 1992
85	R.F.C.Walters. Introduction to extensive and distributive categories - Carboni, Lack - 1993
70	D.P.: Control operators, the SECD machine and the λcalculus - Felleisen, Friedman - 1986
59	Call-by-value games - Abramsky, McCusker - 1998
58	Full abstraction for functional languages with control - Laird - 1997
57	and N.Yoshida, Game-theoretic analysis of call-by-value computation - Honda
45	Controlling Effects - Filinski - 1996
44	Back to direct style - Danvy
31	A semantic analysis of control - Laird - 1998
23	Games and full abstraction for non-deterministic languages - Harmer - 1999
21	A syntactic approach to modularity in denotational semantics - Cenciarelli, Moggi - 1993
9	Polarized category theory, modules, and game semantics. Theory and Applications of Categories, 18(2):4–101, 2007. It may also be a good idea to allow for the left and right options to be drawn from different categories for generality. For instance, the Ab - Cockett, Seely
9	A fully abstract semantics for a higher-order functional language with nondeterministic computation - Jeffrey - 1999
4	Un interpréteur de λ-calcul - Krivine - 1985
4	Exceptions, continuations and macro-expressiveness - Laird - 2002