Changes between Version 9 and Version 10 of Status/Oct11

Oct 27, 2011 10:16:47 PM (6 years ago)



  • Status/Oct11

    v9 v10  
    6161  Since we do not give a definition for `T` in the `instance` declaration, it filled in with the default given in the `class` declaration, just as if you had written `type T Int = [Int]`.
     63 * '''Monad comprehensions.'''  After a long absence, monad comprehensions are back, thanks to George Giorgidze and his colleagues.  With `{-# LANGUAGE MonadComprehensions #-}` the comprehension `[ f x | x <- xs, x>4 ]` is intrepeted in an arbitrary monad, rather than being restricted to lists.  Not only that, but it generalises nicely for `then` and `group` forms too, and fully supports rebindable syntax.  See their paper "Bringing back monad comprehensions" [[ MonadComp]] at the 2012 Haskell Symposium.
    6365 * '''Improvements to the implementation of type constraints.'''  Over the last six months, Dimitrios and Simon PJ (with Stephanie Weirich and Brent Yorgey) have figured out several improvements to the GHC's type constraint solver and its strongly-typed Core language.  The changes to the constraint solver eliminate hundreds of lines of code, and make it more efficient as well.  The changes to the Core language make it treat equality constraints uniformly with other type constraints; this makes the internals vastly more uniform.  These changes are mostly invisible to programmers, but the changes to Core allow us to support equality superclasses for the first time.  Details in our paper "Practical aspects of evidence-based compilation in System FC" [[ NewFC]]
    125127 * [Cloud] ''Haskell for the cloud'', Epstein, Black, Peyton Jones, ICFP 2011,
     129 * [!MonadComp] ''Bringing back monad comprehenions'', George Giorgidze, Torsten Grust, Nils Schweinsberg, and Jeroen Weijers, Haskell Symposium 2011,
    127131 * [NewFC] ''Practical aspects of evidence-based compilation in System FC'', Vytiniotis and Peyton Jones, rejected by to ICFP 2011,