104 research outputs found

    Efficient and Correct Stencil Computation via Pattern Matching and Static Typing

    Get PDF
    Stencil computations, involving operations over the elements of an array, are a common programming pattern in scientific computing, games, and image processing. As a programming pattern, stencil computations are highly regular and amenable to optimisation and parallelisation. However, general-purpose languages obscure this regular pattern from the compiler, and even the programmer, preventing optimisation and obfuscating (in)correctness. This paper furthers our work on the Ypnos domain-specific language for stencil computations embedded in Haskell. Ypnos allows declarative, abstract specification of stencil computations, exposing the structure of a problem to the compiler and to the programmer via specialised syntax. In this paper we show the decidable safety guarantee that well-formed, well-typed Ypnos programs cannot index outside of array boundaries. Thus indexing in Ypnos is safe and run-time bounds checking can be eliminated. Program information is encoded as types, using the advanced type-system features of the Glasgow Haskell Compiler, with the safe-indexing invariant enforced at compile time via type checking

    Use of SMS texts for facilitating access to online alcohol interventions: a feasibility study

    Get PDF
    A41 Use of SMS texts for facilitating access to online alcohol interventions: a feasibility study In: Addiction Science & Clinical Practice 2017, 12(Suppl 1): A4

    Bias in robust estimation caused by discontinuities and multiple structures

    No full text

    Soil fertility and organic matter as critical componennnts of production systems

    No full text
    ix+166hlm.;23c

    Bucketing Techniques in Robust Regression for Computer Vision

    No full text
    • 

    corecore