... | ... | @@ -68,12 +68,19 @@ Several people have developed syntactic innovations, which are (or will shortly |
|
|
are two 'x's in scope. Record field disambiguation just uses the constructor
|
|
|
to decide which 'x' you mus mean.
|
|
|
|
|
|
>
|
|
|
> >
|
|
|
> > >
|
|
|
> > >
|
|
|
> > > None of these changes tackle the deeper issue of whether or not
|
|
|
> > > Haskell's current approach to records is the Right Way; rather the
|
|
|
> > > changes just make the current approach work a bit better.
|
|
|
> > > Furthermore, they are all somewhat controversial, because they make it
|
|
|
> > > harder to see where something comes into scope. Let's see what you think!
|
|
|
> > >
|
|
|
> > >
|
|
|
> >
|
|
|
>
|
|
|
|
|
|
- **View patterns** are implemented, by Dan Licata. Here's a simple example:
|
|
|
|
... | ... | @@ -85,7 +92,7 @@ Several people have developed syntactic innovations, which are (or will shortly |
|
|
f (polar -> (r,theta)) = r <= 1
|
|
|
```
|
|
|
|
|
|
Here 'polar' is an ordinary function, used to transform the Complex to polar form. The view pattern is the argument pattern for 'f'. Many details [here](https://gitlab.haskell.org/trac/ghc/wiki/ViewPatterns).
|
|
|
Here 'polar' is an ordinary function, used to transform the Complex to polar form. The view pattern is the argument pattern for 'f'. Many details [here](http://hackage.haskell.org/trac/ghc/wiki/ViewPatterns).
|
|
|
|
|
|
- **Generalised list comprehensions** (see [Comprehensive comprehensions: comprehensions with "Order by" and "Group by", Phil Wadler and Simon Peyton Jones, Haskell Workshop 2007](http://research.microsoft.com/%7Esimonpj/papers/list-comp/index.htm)) have been implemented by Max Bolinbroke. Example:
|
|
|
|
... | ... | @@ -97,8 +104,17 @@ Several people have developed syntactic innovations, which are (or will shortly |
|
|
, then take 5 ]
|
|
|
```
|
|
|
|
|
|
>
|
|
|
> >
|
|
|
> >
|
|
|
> > More details [here](https://gitlab.haskell.org/trac/ghc/wiki/SQLLikeComprehensions).
|
|
|
> > More details [here](http://hackage.haskell.org/trac/ghc/wiki/SQLLikeComprehensions).
|
|
|
> >
|
|
|
> >
|
|
|
>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
- We are keen to get Geoff Mainland's **quasi-quoting mechanism** into
|
|
|
GHC (see "Why It's Nice to be Quoted: Quasiquoting for Haskell",
|
... | ... | @@ -130,9 +146,10 @@ a result we have a partially-working implementation, and we |
|
|
understand the problem much better, but there is still much to
|
|
|
do, both on the theoretical and practical front. It's trickier
|
|
|
than we thought! We have a short paper [Towards open type functions for Haskell](http://research.microsoft.com/%7Esimonpj/papers/assoc-types/index.htm) which
|
|
|
describes some of the issues, and an [wiki page](https://gitlab.haskell.org/trac/ghc/wiki/TypeFunctions) that we keep up to date; it has a link to details of implementation status. This is all joint work with
|
|
|
describes some of the issues, and an [wiki page](http://hackage.haskell.org/trac/ghc/wiki/TypeFunctions) that we keep up to date; it has a link to details of implementation status. This is all joint work with
|
|
|
Martin Sulzmann, Manuel Chakravarty, and Tom Schrijvers.
|
|
|
|
|
|
|
|
|
## Parallel GC
|
|
|
|
|
|
|
... | ... | |