Ben Lippmeier

While you were reading this Steggles fixed 3 DDC bugs.

Ben Lippmeier
School of Computer Science and Engineering
University of New South Wales
UNSW Sydney NSW 2052
Australia
Google Maps

email: benl (wibble) cse.unsw.edu.au

(code bin)
(youtube demo channel)

About Me

I am a Research Associate in the
Programming Languages and Systems group in the
School of Computer Science and Engineering at the
University of New South Wales
I was previously a PhD student and lecturer at the School of Computer Science at the Australian National University.
I spend most of my time implementing Functional Programming Languages.
I am a regular at fp-syd.
I have kept a variety of aquarium fish, though not always successfully.
When I'm not doing the above I practice Aikido.

Publications

Work Efficient Higher-Order Vectorisation
(tech report), (dph-reference-array.tgz), Submitted to ICFP 2012,
with Manuel Chakravarty, Gabriele Keller, Roman Leshchinskiy and Simon Peyton Jones
Efficient Parallel Stencil Convolution in Haskell
(slides), (demo video), Haskell 2011
with Gabriele Keller
Regular, shape-polymorphic, parallel arrays in Haskell
(slides), ICFP 2010,
with Gabriele Keller, Manuel Chakravarty, Roman Leshchinskiy and Simon Peyton Jones
Type Inference and Optimisation for an Impure World
ANU 2010 (PhD thesis)
Witnessing Purity, Constancy and Mutability
(slides), APLAS 2009
An AMPLE Implementation, IFL 2003 (draft proceedings)
with Clem Baker-Finch

Projects

DDC - The Disciplined Disciple Compiler

Disciple is an explicitly lazy dialect of Haskell. DDC uses effect and closure typing to allow destructive update and arbitrary side-effects to play nicely with laziness and compiler optimisations. It also supports real (object.field) type-directed projections and some other useful features. DDC is still a research project, but it'll compile some programs if you're nice to it. Update data without state monads. Write putStr "foo" and mean it. Learn to live again.

(wiki) Project page
(blog) Disciple Development
(paper) Witnessing Mutability, Purity and Aliasing for Program Optimisation
DRAFT PAPER. Still has some issues.
There is also an appendix containing proofs of language properties
An expansion of the APLAS 2009 paper.
(talk) Joint Evaluation Contexts, (video) FP-SYD July 2011
(talk) Falling Down the Naming Well, FP-SYD April 2011
(talk) Head Lazy but Shapely, and Deeply Mutable, SAPLING November 2010
(talk) PeekOn and PokeOn, (video), HIW October 2010
(talk) The Poisoning Problem, FP-SYD June 2009
(talk) The Disciplined Disciple Compiler, University of Melbourne May 2008

(source) (core)

(source)

GHC - The Glasgow Haskell Compiler

GHC is the industrial strength Haskell compiler. As a research associate at UNSW my main job is to help with the Data Parallel Haskell project. In Q1 2009 I spent three months working on the GHC on OpenSPARC project, where I repaired GHC's support for the SPARC architecture and benchmarked it on the highly multi-threaded UltraSPARC T2 (Niagra 2) architecture. In Q3 2007 I spent three months working at GHC HQ where I wrote a new graph coloring register allocator for the native code generator.

(blog) GHC on SPARC
(wiki) The GHC Register Allocator
(talk) Flattening and Replication in Data Parallel Haskell, FP-SYD May 2011
(talk) Beyond Haskell, HIW 2010
(talk) GHC on the OpenSPARC T2, (video), HIW 2009
(talk) Graph Colouring Register Allocation in the Glasgow Haskell Compiler, SAPLING November 2007

Gloss (formerly ANUPlot)

Gloss hides the pain of drawing simple 2D graphics in Haskell behind a nice data structure and a couple of display functions. Used in 1st year CompSci at the ANU and UNSW. The library uses the GHC OpenGL binding, but you won't have to worry about any of that. Get something cool on the screen in under 10 minutes.

(source)

Repa

Repa is a Haskell library that provides high performance, regular, multi-dimensional, shape polymorphic parallel arrays. All numeric data is stored unboxed. Functions written with the Repa combinators are automatically parallel provided you supply +RTS -Nwhatever on the command line when running the program. Repa means "turnip" in Russian. If you don't like turnips then this library probably isn't for you.

Hackage page
Development Wiki
(talk) Efficient Parallel Stencil Convolution in Haskell, FP-SYD March 2011
(talk) Regular Shape Polymorphic Parallel Arrays in Haskell, FP-SYD August 2010, ICFP September 2010

(wiki)

(blog post) (demo video)

Collar Weights

Code and switching hardware for the Collar Weights mixed media installation. Inside each of the collars are electroluminescent lamps that are programmed to switch on, illuminating texts that become visible through the fabric. Phrases from interviews with the owners of the collars are played.
With Alexandra Gillespie and Somaya Langley.

Alex's photostream
Bathurst Regional Art Gallery, 7th August - 20th September 2009
Canberra Contemporary Art Space (CCAS) Gorman House, 7th February - 14th March 2009
Canberra Contemporary Art Space (CCAS) Manuka, 6th - 16th November 2008

AMPLE - An Abstract Machine for Parallel Lazy Evaluation

An experimental environment that can be used to study the behavior of parallel functional programs in terms of an abstract machine, without needing to worry about details specific to a native implementation. Can execute programs fully speculatively to determine the maximum embodied parallelism in a piece of code.

Project Page

full-speculation

with par/seq

Sunshine II RISC CPU Simulator

A simulator for a classic 5 stage pipelined RISC processor. Visualisation of pipeline stalls, calculation of cpi, single step mode, breakpoints, instruction counts, memory mapped file and console IO. Pipeline setup is easy to change.

Darcs repository

High temperature superconducting microwave filters

Design and implementation of a filter intended to block interference that the Australia Telescope Compact Array was suffering from a nearby microwave distribution service (MDS). A summer vacation scholarship position, supervised by Russell Gough and Graham Gay of the Receivers Group.