BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Efficient and Correct Stencil Computations via Pattern Matching an
 d Type Checking - Dominic Orchard\, Computer Lab
DTSTART:20110902T141500Z
DTEND:20110902T151500Z
UID:TALK32687@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:This talk presents latest developments on the Ypnos domain-spe
 cific language for programming stencil computations in Haskell. Stencil co
 mputations\, which involve aggreagate operations over the elements of an a
 rray\, 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 compil
 er and to the programmer via specialised syntax called grid patterns. Ypno
 s has the safety invariant that well-typed programs cannot index outside o
 f array boundaries. Thus correctness guarantees are provided and run-time 
 bounds checking can be eliminated\, improving performance. Program informa
 tion is encoded in the types of Ypnos expressions\, using advanced type-sy
 stem features of the Glasgow Haskell Compiler. Safe-indexing in Ypnos is a
  decidable property and is enforced at compile time via type checking. \n\
 nThis is a 20-minute practice talk for the DSL 2011 conference. 
LOCATION:SS03\, Computer Laboratory
END:VEVENT
END:VCALENDAR