In an exceptionally busy fplunch:
- Our visitor Daan Leijen gave a quick introduction to his research into using C# lambda expressions to allow programmers to introduce parallelism without the usual overheads. This served as an introduction to C# for most of the audience.
- Liyang talked through his side project trying to introduce Conor’s idiom brackets using Template Haskell to do the transformations, he has some slides for more info — link coming soon
- Conor then introduced his dissection work, showing how the a tail recursive fold for trees relies on a control structure which can be calculated for any fixed point of a polynomial (in fact any indexed container). This calculation is dissection and it generalises differentiation.