37 research outputs found

    Algorithmic solution of higher type equations

    Full text link

    THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT

    No full text
    AbstractThis paper considers a generalisation of selection functions over an arbitrary strong monad T, as functionals of type JRTX=(XR)TXJ_R^T X = (X \to R) \to TX. It is assumed throughout that R is a T-algebra. We show that JRTJ_R^T is also a strong monad, and that it embeds into the continuation monad KRX=(XR)RK_R X = (X \to R) \to R. We use this to derive that the explicitly controlled product of T-selection functions is definable from the explicitly controlled product of quantifiers, and hence from Spector’s bar recursion. We then prove several properties of this product in the special case when T is the finite powerset monad Pf(){\cal P}_{\rm{f}} \left( \cdot \right). These are used to show that when TX=Pf(X)TX = {\cal P}_{\rm{f}} \left( X \right) the explicitly controlled product of T-selection functions calculates a witness to the Herbrand functional interpretation of the double negation shift.</jats:p

    Higher-order Games with Dependent Types

    No full text

    Operational Domain Theory and Topology of a Sequential Programming Language

    No full text

    A Principle of Induction

    No full text

    Preface to the volume on Recent developments in domain theory: a collection of papers in honour of Dana S. Scott

    No full text
    corecore