Computer Science – Programming Languages
Scientific paper
2011-09-05
EPTCS 66, 2011, pp. 68-92
Computer Science
Programming Languages
In Proceedings DSL 2011, arXiv:1109.0323
Scientific paper
10.4204/EPTCS.66.4
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.
Mycroft Alan
Orchard Dominic
No associations
LandOfFree
Efficient and Correct Stencil Computation via Pattern Matching and Static Typing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient and Correct Stencil Computation via Pattern Matching and Static Typing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and Correct Stencil Computation via Pattern Matching and Static Typing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-449104