Eric Holk
Right now we have a bunch of hardcoded OpenCL paths that seem to work for a variety of machines. However, it's pretty common to find a machine that doesn't put...
This would be a fun example program/benchmark/test case.
Harlan is a bit too aggressive about allocating new copies of ADTs. Currently, it allocates from a region every time and ADT instance is assigned to a field in a...
@webyrd sent me a link to the Shonan HPC Challenge a while back: http://okmij.org/ftp/meta-programming/HPC.html#shonan-challenge It seems to be about using generic programming to have both high level and performant code....
This is different from run length encoding as a compression format, at least in my mind. This is for rendering information visualizations. As I understand it, the idea is you...
As the language has evolved we've accumulated a lot of now-dead code in the compiler. Doing a code-coverage version of the test suite would help us identify code that's not...
This would let us build much richer libraries. It'd probably make most since to specialize each data structure and function for the types it occurs at. This could probably be...
Since we have macros, the current kernel form might as well be a macro that expands into something that more closely resembles the form used internally by the compiler. This...
If effect, we need an efficient way to do `concatMap`. One way I've been considering is changing out underlying vector data structure to be a [rope](http://en.wikipedia.org/wiki/Rope_%28data_structure%29). This should support efficient...
Scan is a very powerful operator. We should add it and explore its performance characteristics.