No label defined (Q4680357)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2172969
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2172969

      Statements

      0 references
      1 June 2005
      0 references
      call-by-push-value
      0 references
      adjunction
      0 references
      monad
      0 references
      denotational semantics
      0 references
      call-by-name
      0 references
      call-by-value
      0 references
      The call-by-push-value (CBPV) paradigm was introduced by the author as an extension of \textit{E. Moggi}'s use of a strong monad to model call-by-value languages [Inf. Comput. 93, 55--92 (1991; Zbl 0723.68073)], and subsuming both call-by-value and call-by-name. The strong monad \(T\) in Moggi's approach is decomposed as the key type constructors \(U\) and \(F\) such that the composite \(UF=T\). In all the specific models studied, it happened that the call-by-push-value approach decomposes Moggi's monad into an adjunction, but the original syntax of CBPV, with two judgements ({values} and {computations}) did not confirm such situation. The paper is focussed in the development of a new categorical semantics for CBPV, using {stacks} as an extra judgement. It is shown that CBPV, incorporating stack terms, has a simple categorical semantics based on an adjunction between values and stacks and without coherence requirements. The semantics is described incrementally: First, locally indexed categories and the opGrothen\-dieck construction are introduced in order to give the basic structure for interpreting the three judgements: values, stacks and computations. Then, looking at the universal property required to interpret each type constructor, a model is defined to be a strong adjunction with countable coproducts, countable products and exponentials. A wide range of instances of this structure is shown, such as divergence, storage, erratic choice, continuations, possible worlds and games, in each case resolving the strong monad from the literature into a strong adjunction. Finally, it is shown 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.
      0 references

      Identifiers