Mathys Rennela - Convexity and Order in Probabilistic Call-by-Name FPC

lmcs:1533 - Logical Methods in Computer Science, November 12, 2020, Volume 16, Issue 4 -
Convexity and Order in Probabilistic Call-by-Name FPCArticle

Authors: Mathys Rennela

    Kegelspitzen are mathematical structures coined by Keimel and Plotkin, in order to encompass the structure of a convex set and the structure of a dcpo. In this paper, we ask ourselves what are Kegelspitzen the model of. We adopt a categorical viewpoint and show that Kegelspitzen model stochastic matrices onto a category of domains. Consequently, Kegelspitzen form a denotational model of pPCF, an abstract functional programming language for probabilistic computing. We conclude the present work with a discussion of the interpretation of (probabilistic) recursive types, which are types for entities which might contain other entities of the same type, such as lists and trees.

    Volume: Volume 16, Issue 4
    Published on: November 12, 2020
    Accepted on: October 1, 2020
    Submitted on: July 18, 2016
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages
      Source : OpenAIRE Graph
    • Quantum Computation, Logic, and Security; Funder: European Commission; Code: 320571


    Consultation statistics

    This page has been seen 758 times.
    This article's PDF has been downloaded 188 times.