Friday 9th March, 2012
3:55pm to 4:30pm
We investigate the facilities in various languages for higher-order programming-in-the-large. Scala developers often borrow from Haskell, but what more can we learn from the ML family? What about (heaven forbid) C++ and its template libraries? Do dynamically-typed languages enable more sophisticated code recombination and reuse? We'll ask these questions, answer some of them, and generally compare, contrast, and encode all sorts of modularity with Scala.
*The “modular module” moniker was lifted from a paper by Xavier Leroy.
Computer science professor, photographer, musician, hacker, etc. bio from Twitter
Sign in to add slides, notes or videos to this session