GHC Status October 2011
GHC is still humming along, with the 7.2.1 release (more of a "technology preview" than a stable release) having been made in August, and attention now focused on the upcoming 7.4 branch. By the time you read this, the 7.4 branch will have been created, and will be in "feature freeze". We will then be trying to fix as many bugs as possible before releasing later in the year.
We advertised 7.2 as a technology preview, expecting 7.4 to merely consolidate the substantial new features in 7.2. But as it turns out GHC 7.4 will have a further wave of new features, especially in the type system. Significant changes planned for the 7.4 branch are:

Declarations at the GHCi prompt. Daniel WinogradCort (with help from Simon Marlow) has extended GHCi so that it is possible to give any declaration at the ghci prompt. For example,
Prelude> data D = D Int Prelude> case D 5 of D x > print x 5
This has already been merged, so will definitely be in 7.4.

Data type promotion and kind polymorphism. As we do more and more typelevel programming, the lack of a decent kind system (to make sure that your typelevel programs make sense) has become an increasingly pressing issue. If all goes well, GHC 7.4 will take a substantial step forward:

First, all simple data types (including lists and tuples) will automatically be "promoted" to be kinds as well, a design inspired by Conor McBride's Strathclyde Haskell Extension [http://personal.cis.strath.ac.uk/~conor/pub/she/ SHE](http://personal.cis.strath.ac.uk/~conor/pub/she/ SHE). For example:
type family F :: Bool > * type instance F True = Int type instance F False = Char

Second, GHC will support full kind polymorphism. For example, consider the following data type declaration
data T f a = MkT (f a)  T :: forall k. (k > *) > k > *
GHC will now infer the polymorphic kind signature above, rather that "defaulting" to
T :: (*>*) > * > *
as Haskell98 does.

These new kindsystem developents are described in "Giving Haskell a promotion" [http://research.microsoft.com/~simonpj/papers/extf/ KindPolymorphism](http://research.microsoft.com/~simonpj/papers/extf/ KindPolymorphism). Julien Cretin and Pedro Magalhães have done all the implementation.

Constraint kinds. Max Bolingbroke has implemented another extension to GHC's kind system, by adding the kind
Constraint
that classifies type constraints. This turns out to be a rather neat way to implement all the joy of Tom Schrijvers and Dominic Orchard's paper "Haskell type constraints unleashed" [http://tomschrijvers.blogspot.com/2009/11/haskelltypeconstraintsunleashed.html Unleashed](http://tomschrijvers.blogspot.com/2009/11/haskelltypeconstraintsunleashed.html Unleashed). For example, you can now saytype Stringy a = (Show a, Read a) f :: Stringy a => a > a f = read . show
Here, the constraint
(Stringy a)
is a synonym for(Show a, Read a)
. More importantly, by combining with associated types, we can write some fundamentally new kinds of programs:class Coll c where type X a :: Constraint insert :: X a => a > c a > c a instance Coll [] where type X a = Eq a insert x [] = [x] insert x ys0@(y:ys)  x==y = ys0  otherwise = y : insert x ys
Here
X
is an associated constraint synonym of the classColl
. The key point is that different instances can give different definitions toX
. The GHC wiki page describes the design [https://gitlab.haskell.org/trac/ghc/wiki/KindFact WikiConstraint](https://gitlab.haskell.org/trac/ghc/wiki/KindFact WikiConstraint), and Max's blog posts give more examples [http://blog.omegaprime.co.uk/?p=61 ConstraintFamlies], [http://blog.omegaprime.co.uk/?p=127 ConstraintKind](http://blog.omegaprime.co.uk/?p=61 ConstraintFamlies], [http://blog.omegaprime.co.uk/?p=127 ConstraintKind). 
Associated type synonym defaults. Haskell lets you give a default method for the operations of a class. Associated type synonym defaults let you declare a default type instance for the associated type synonyms of a class. This feature, implemented by Max Bolingbroke, nicely fills out missing design corner. For example
class C a where type T a type T a = [a]  Default synonym f :: T a > a instance C Int f (x:xs) = x  No definition given for T
Since we do not give a definition for
T
in theinstance
declaration, it filled in with the default given in theclass
declaration, just as if you had writtentype T Int = [Int]
. 
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 interpreted in an arbitrary monad, rather than being restricted to lists. Not only that, it also generalises nicely for parallel/zip and SQLlike comprehensions. The aforementioned generalisations can be turned on by enabling theMonadComprehensions
extension in conjunction with theParallelListComp
andTransformListComp
extensions.
Rebindable syntax is fully supported for standard monad comprehensions with generators and filters. We also plan to allow rebinding of the parallel/zip and SQLlike monad comprehension notations.
For further details and usage examples, see the paper "Bringing back monad comprehensions" [http://db.inf.unituebingen.de/files/giorgidze/haskell2011.pdf MonadComp](http://db.inf.unituebingen.de/files/giorgidze/haskell2011.pdf MonadComp) at the 2011 Haskell Symposium.

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 stronglytyped 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 evidencebased compilation in System FC" [http://research.microsoft.com/~simonpj/papers/extf/ NewFC](http://research.microsoft.com/~simonpj/papers/extf/ NewFC)

Profiling and hpc overhaul. GHC currently has three different ways of tracking which pieces of code are executed: constcentre profiling, HPC coverage, and GHCi debugger breakpoints. Each is implemented in a different, and somewhat ad hoc way. Simon Marlow has overhauled the whole system, unifiying the three mechanisms into one. On the way he has improved the semantics of cost centre stacks, which should lead to more useful time and space profiles. The
+RTS xc
runtime flag, which displays a stack backtrace when an exception is thrown, has been greatly improved and should now produce useful information in most cases (it is still only available when the program is compiled for profiling, however). 
Changes to the way Safe Haskell works[http://www.scs.stanford.edu/~davidt/safehaskell.html SafeHaskell](http://www.scs.stanford.edu/~davidt/safehaskell.html SafeHaskell). David Terei has improved the design of Safe Haskell since the 7.2.1 release. In particular, it will no longer cause build failures for users who do not explicitly enable it. The checking that a package is trusted will only be done now if the
fpackagetrust
flag is present. This allows package authors to use theTrustworthy
pragma as they please and not worry that a users local package configuration will cause build failures. Users who are explicitly using Safe Haskell to construct secure systems should make use of thefpackagetrust
flag to maintain the security of the old design. Also since the 7.2.1 release, the safe status of a module will now be automatically inferred by Safe Haskell. These two changes make Safe Haskell easier to use and push it behind the scenes where it mostly belongs.
Joining in
We continue to receive some fantastic help from a number of members from the Haskell community. Amongst those who have rolled up their sleeves recently are:
 Ben Gamari, Karel Gardas and Stephen Blackheath have been working towards getting a registerised ARM port working
 Many people, including Sergei Trofimovich, Erik de Castro Lopo, Joachim Breitner, Thorkil Naur, David M Peixotto and Ben Lippmeier, have contributed platform specific fixes for other platforms
 Reiner Pope added Template Haskell support for unresolved infix expressions and patterns
 Jose Pedro Magalhaes has replaced the old generics support with a new design
 Peter Wortmann taught GHC how to compile ObjectiveC++ files
 Sam Anklesaria added support for additional .ghci files
 Mikolaj Konarski and Duncan Coutts have improved GHC's event logging
 Geoffrey Mainland improved error messages for unterminated quasiquotations
 Johan Tibell implemented a "population count" primitive, and some other optimisations
 Ross Paterson has fixed some problems with Arrows
 Edward Z. Yang has been improving the RTS
 George Roldugin improved the syncall tool used by GHC developers
 Austin Seipp has been improving some of the compiler documentation
 Miscellaneous fixes and improvements from Daniel Fischer, Michal Terepeta and Lennart Kolmodin
As ever, there is a lot still to do, and if you wait for us to do something then you may have to wait a long time. So don't wait; join in!
Other developments
Work continues on improving GHC in various directions. Active projects we know about include:

Cloud Haskell. The first version of Cloud Haskell has been released, aiming to bring Erlangstyle distributed actors to Haskell http://hackage.haskell.org/package/remote. See also the paper at Haskell Symposium 2011 [http://research.microsoft.com/enus/um/people/simonpj/papers/parallel/remote.pdf CloudHaskell](http://research.microsoft.com/enus/um/people/simonpj/papers/parallel/remote.pdf CloudHaskell). Next, we're working on expanding the backend to work with HPC environments.

Parallel GHC project: Microsoft Research is funding a 2year project to push the realworld use of parallel Haskell. We are now into the second year of the project and have some promising results from the project partners. We have also taken on two new commercial partner organisations which are interested in using Cloud Haskell. In addition to helping the project partners we have been working on parallel profiling tools: we made a release of [http://www.haskell.org/haskellwiki/HaskellImplementorsWorkshop/2011/Coutts ThreadScope](http://www.haskell.org/haskellwiki/HaskellImplementorsWorkshop/2011/Coutts ThreadScope) with new features for profiling programs that use par sparks. For more details, see the HCAR Parallel GHC project entry, and the project home page [http://www.haskell.org/haskellwiki/Parallel_GHC_Project ParallelGhcProject](http://www.haskell.org/haskellwiki/Parallel_GHC_Project ParallelGhcProject)

Data Parallel Haskell. GHC 7.2 includes rudimentary support for Data Parallel Haskell — just enough for a little experimentation and to run simple benchmarks. We are working on significantly improving this for GHC 7.4. In particular, we aim to support the use of basic types and classes from the standard Prelude (replacing the minimalistic mock Prelude that DPH programs had to use so far), and we are working on drastically improved space and time complexity for shared data structures in nested parallel programs, such as the BarnesHut nbody algorithm.
Binary distributions of GHC 7.x require the installation of separate Data Parallel Haskell libraries from Hackage — follow the instructions in the wiki documentation [http://haskell.org/haskellwiki/GHC/Data_Parallel_Haskell DPH](http://haskell.org/haskellwiki/GHC/Data_Parallel_Haskell DPH).
Moreover, we are working at the third revision of the regular parallel array library [http://hackage.haskell.org/package/repa Repa](http://hackage.haskell.org/package/repa Repa). It uses indexed types to distinguish multiple array representations, which helps to guide users to write highperformance code. To see it in action, check out Ben Lippmeier's recent demo [http://youtu.be/v_0Yyl19fiI Quasicrystals](http://youtu.be/v_0Yyl19fiI Quasicrystals).

Contracts. Work on adding contracts to Haskell, along the lines of Dana Xu's these, but using a first order logic theorem prover to check contract satisfaction (with Koen Claessen, Dimitrios Vytiniotis, CharlesPierre Astolfi, and Nathan Collins).

Liquid types. Ranjit Jhala is working on adding liquid types to GHC. Liquid Types are a form of (dependent) refinement types that use predicate abstraction and SMT solvers to carry out type inference. A prototype has been built that works for a subset of the language (without typeclasses) [http://goto.ucsd.edu/~rjhala/liquid Liquid](http://goto.ucsd.edu/~rjhala/liquid Liquid). Currently, we are working on ways of handling at the basic typeclasses (Ord, Num etc.), and building a webinterface.

Vector instructions. Paul Monday and Geoff Mainland are extending the code generator to exploit vector instructions (with Peter Braam, Duncan Coutts) [https://gitlab.haskell.org/trac/ghc/wiki/SimdLlvm VectorInstructions](https://gitlab.haskell.org/trac/ghc/wiki/SimdLlvm VectorInstructions).

A modular package language for Haskell (with Derek Dreyer and Scott Kilpatrick) [https://gitlab.haskell.org/trac/ghc/wiki/PackageLanguage Packages](https://gitlab.haskell.org/trac/ghc/wiki/PackageLanguage Packages).
Bibliography

[CloudHaskell] Towards Haskell in the Cloud, Jeff Epstein, Andrew P. Black, and Simon Peyton Jones, Haskell Symposium 2011, http://research.microsoft.com/~simonpj/papers/parallel/remote.pdf

[ConstraintFamilies] Constraint families, Max Bolingbroke blog post, http://blog.omegaprime.co.uk/?p=61

[ConstraintKind] "Constraint kinds for GHC", Max Bolingbroke blog post, http://blog.omegaprime.co.uk/?p=127

[DPH] Data Parallel Haskell documentation, DPH Team, http://haskell.org/haskellwiki/GHC/Data_Parallel_Haskell

[KindPolymorphism] Giving Hasell a promotion, Brent Yorgey, Stephanie Weirich, Julien Cretin, Dimitrios Vytiniotis, and Simon Peyton Jones, submitted to TLDI'12, http://research.microsoft.com/~simonpj/papers/extf/

[Liquid] Liquid types home page, Ranjit Jhala, http://goto.ucsd.edu/~rjhala/liquid

[MonadComp] Bringing back monad comprehensions, George Giorgidze, Torsten Grust, Nils Schweinsberg, and Jeroen Weijers, Haskell Symposium 2011, http://db.inf.unituebingen.de/files/giorgidze/haskell2011.pdf

[NewFC] Practical aspects of evidencebased compilation in System FC, Vytiniotis and Peyton Jones, rejected by to ICFP 2011, http://research.microsoft.com/~simonpj/papers/extf/

[Packages] A package language for Haskell, GHC wiki page, https://gitlab.haskell.org/trac/ghc/wiki/PackageLanguage

[ParallelGhcProject] The Parallel GHC Project home page, http://www.haskell.org/haskellwiki/Parallel_GHC_Project

[Quasicrystals] Quasicrystals Demo, Ben Lippmeier, http://youtu.be/v_0Yyl19fiI

[Repa] Repa: Regular, shapepolymorphic parallel arrays in Haskell, http://hackage.haskell.org/package/repa

[SafeHaskell] The Safe Haskell home page, David Terei, http://www.scs.stanford.edu/~davidt/safehaskell.html

[SHE] The Strathclyde Haskell Enhancement, Conor McBride, 2010, http://personal.cis.strath.ac.uk/~conor/pub/she/

[ThreadScope] Spark Visualization in ThreadScope, Duncan Coutts, Haskell Implementors workshop 2011, http://www.haskell.org/haskellwiki/HaskellImplementorsWorkshop/2011/Coutts

[Unleashed] "Haskell type constraints unleashed", Tom Schrijvers and Dominic Orchard, FLOPS 2010, http://tomschrijvers.blogspot.com/2009/11/haskelltypeconstraintsunleashed.html

[VectorInstructions] Using SIMD instructions via the LLVM back end, GHC wiki page, https://gitlab.haskell.org/trac/ghc/wiki/SimdLlvm

[WikiConstraint] Adding kind Constraint, GHC wiki page, https://gitlab.haskell.org/trac/ghc/wiki/KindFact