University of Cambridge > > Computer Laboratory Programming Research Group Seminar > Efficient and Correct Stencil Computations via Pattern Matching and Type Checking

Efficient and Correct Stencil Computations via Pattern Matching and Type Checking

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dominic Orchard.

This talk presents latest developments on the Ypnos domain-specific language for programming stencil computations in Haskell. Stencil computations, which involve aggreagate operations over the elements of an array, are a common programming pattern in scientific computing, games, and image processing. Ypnos allows declarative, abstract specification of a stencil computation, exposing the structure of a problem to the compiler and to the programmer via specialised syntax called grid patterns. Ypnos has the safety invariant that well-typed programs cannot index outside of array boundaries. Thus correctness guarantees are provided and run-time bounds checking can be eliminated, improving performance. Program information is encoded in the types of Ypnos expressions, using advanced type-system features of the Glasgow Haskell Compiler. Safe-indexing in Ypnos is a decidable property and is enforced at compile time via type checking.

This is a 20-minute practice talk for the DSL 2011 conference.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity