Meetings in Summer 2007

From The Programming Languages and Systems Research Group
Revision as of 17:03, 25 May 2007 by Muehlber (talk | contribs)

Jump to: navigation, search
Thursday, 26 April : " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 03 May Ben Mitchel: "Animating Simulated Annealing with Lego Mindstorms"
12:20 -- 12:40, CS202J Abstract: This project explores the physical animation of simulated annealing using Lego Mindstorms, and assesses the suitability of this approach to algorithm animation for use as an interactive teaching aid.

Thursday, 03 May Ian Boden: "Animation of Garbage Collection Algorithms using Lego Mindstorms"
12:40 -- 13:00, CS202J Abstract: My project investigates the use of Lego Mindstorms for educating students about Garbage Collection algorithms. It concentrates on producing a tool for demonstration and independent learning which is as capable of educating as standard methods with the advantage of making the topic more exciting for the students.

Thursday, 10 May : " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 17 May : " "
12:15 -- 13:15, CS119N Abstract:

Thursday, 24 May Malcolm Wallace: "Functional Programming and Visualisation: A Lazy PolyTypic Grid"
12:15 -- 13:15, CS202J Abstract: This talk will give an overview of the Lazy Polytypic Grid project,and outline some of our early results. Our aim is to explore how to make existing well-known visualisation algorithms (e.g. volumetric surface extraction):
  • lazy, so that the whole dataset is not required all at once;
  • datatype-generic (polytypic), so that the algorithm is independent of the original dataset storage format, including questions of irregular and unstructured sampling;
  • grid-enabled, such that it is possible to distribute the processing tasks across a heterogeneous network of machines, harnessing any implicit parallelism in the algorithms to speed up the calculation for huge datasets.

Thursday, 31 May Neil Mitchell: "Fastest Lambda First"
12:15 -- 13:15, CS202J Abstract: Haskell programs are often very succinct, but what they gain in beauty they can sometimes loose in speed. Work on the GHC compiler has enabled Haskell programs to perform at C speeds, or faster in some cases, but at the cost of using a lower-level style of Haskell.

This talk introduces a new technique for optimisation, which attempts to eliminate any overhead from an algorithm. The idea relies on the first-order transformation presented last term, and attempts to remove all data and higher-order functions from a program. With the techniques presented Haskell can remain beautiful, and perform at the same speed as C.

Thursday, 07 June Colin Runciman: ""
12:15 -- 13:15, CS202J Abstract:

Thursday, 14 June Ian Toyn: "An Update on the ISO Z Standard and Tools"
12:15 -- 13:15, CS202J Abstract: This paper reports on the evolution of the Z standard since the first edition was published by ISO in 2002, and the conformance (or otherwise) of some widely-used Z tools to the evolving standard. It provides a commentary on the new Technical Corrigendum to the Z standard, and may be useful in choosing which Z tool to use.

Thursday, 21 June Detlef Plump: " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 28 June Jonathan Ezekiel: "CAV and PDMC Practice"
12:15 -- 13:15, CS202J Abstract: