... | ... | @@ -12,7 +12,7 @@ However, we still need help with it all. GHC is a community project, and as you |
|
|
|
|
|
- **Applicative is now a superclass of Monad**. After much debate, in GHC 7.10, Applicative is finally a superclass of `Monad`, hence completing the Applicative Monad Proposal.
|
|
|
|
|
|
- **BBP: Foldable/Traversable**. TODO Herbert
|
|
|
- **BBP: Foldable/Traversable**. As part of the so-called "Burning-Bridges Proposal", the monomorphic definitions in `Prelude`/`Data.List`/`Control.Monad` that conflict with those from `Data.Foldable` and `Data.Traversable` have been replaced by their respective ones from `Data.Foldable`/`Data.Traversable`
|
|
|
|
|
|
- **Signature sections**. Lennart Augustsson is implementing `(:: ty)` to work the same as `(\x -> x :: ty)`. Needs a wiki design page.
|
|
|
|
... | ... | @@ -30,7 +30,7 @@ However, we still need help with it all. GHC is a community project, and as you |
|
|
|
|
|
- **Partial type signatures** - Thomas Winant and Dominique Devriese are working on partial type signatures for GHC. A partial type signature is a type signature that can contain *wildcards*, written as underscores. These wildcards can be types unknown to the programmer or types he doesn't care to annotate. The type checker will use the annotated parts of the partial type signature to type check the program, and infer the types for the wildcards. A wildcard can also occur at the end of the constraints part of a type signature, which indicates that an arbitrary number of extra constraints may be inferred. Whereas `-XTypedHoles` allow holes in your terms, `-XPartialTypeSignatures` allow holes in your types. The design as well as a working implementation are currently being simplified [PartialTypeSignatures](partial-type-signatures).
|
|
|
|
|
|
- **Binary literals** ([\#9224](https://gitlab.haskell.org//ghc/ghc/issues/9224)) - Herbert implemented the `-XBinaryLiterals` language extension which finally closes the syntax gap relative to other languages which allow to write base-2 literals such as `0b11001001`.
|
|
|
- **Binary literals** ([\#9224](https://gitlab.haskell.org//ghc/ghc/issues/9224)) - Herbert Valerio Riedel implemented the `-XBinaryLiterals` language extension which finally closes the syntax gap relative to other languages which allow to write base-2 literals such as `0b11001001`.
|
|
|
|
|
|
- **Propositional equality for `GHC.Generics` metadata** - Gabor Greif is working on a conservative approach to retrofit the metadata types generated by `-XDeriveGeneric` with a runtime-observable type equality. The feature is discussed under [GenericsPropositionalEquality](generics-propositional-equality).
|
|
|
|
... | ... | @@ -50,7 +50,7 @@ However, we still need help with it all. GHC is a community project, and as you |
|
|
|
|
|
- **DWARF-based stack tracing** - Peter Wortmann and Arash Rouhani (with support from the Simons) are working on enabling GHC to generate and use DWARF debugging information. This should allow us to obtain stack traces and do profiling without the need for instrumentation. The first stages of this work should land in 7.10, but it's not clear if the full feature set will.
|
|
|
|
|
|
- **Reimplemented GMP-based `Integer` backend ([\#9281](https://gitlab.haskell.org//ghc/ghc/issues/9281))** - This provides a GMP-based `Integer` backend not relying on registering GHC-specific [ custom GMP memory allocators](https://gmplib.org/manual/Custom-Allocation.html) which cause problems when linking to other C-code also using GMP unaware of GHC's memory management.
|
|
|
- **Reimplemented GMP-based `Integer` backend ([\#9281](https://gitlab.haskell.org//ghc/ghc/issues/9281))** - Herbert Valerio Riedel is working on this to provide a GMP-based `Integer` backend not relying on registering GHC-specific [ custom GMP memory allocators](https://gmplib.org/manual/Custom-Allocation.html) which cause problems when linking to other C-code also using GMP unaware of GHC's memory management.
|
|
|
|
|
|
## Frontend, build-system, and miscellaneous changes
|
|
|
|
... | ... | |