On Mon, Aug 13, 2012 at 03:20:53PM +, Philip Holzenspies wrote:
I see some value in your proposal to replace GHC's unlit, mainly in
terms of setting a common standard. Personally, I'd still feel more
comfortable if that proposed standard would be developed as a Hackage
package, so
I've tested this on Ubuntu 12.04 running on ARM (this is using ARM
hard-float ABI) with Ubuntu's provided LLVM 3.0 and it compiles well.
Testsuite summary is attached. We still do have some work to be done on
ARM Linker as majority of failing tests are GHCi related.
Cheers,
Karel
On
| FWIW PolyKinds in 7.4 is rough, and I had experiences where enabling it
| led to compile failures in downstream modules, so this wouldn't
| necessarily have been painless. Hopefully with 7.6 it will be.
PolyKinds is not an advertised feature of 7.4, so you should absolutely not
rely on it
Friends
I'm giving a series of five lectures at the Laser Summer
Schoolhttp://laser.inf.ethz.ch/2012/ (2-8 Sept), on Adventures with types in
Haskell. My plan is:
1. Type classes
2. Type families [examples including Repa type tags]
3. GADTs
4. Kind polymorphism
5. System FC and
On Tue, Aug 14, 2012 at 2:32 PM, Simon Peyton-Jones
simo...@microsoft.comwrote:
Friends
I’m giving a series of five lectures at the Laser Summer
Schoolhttp://laser.inf.ethz.ch/2012/(2-8 Sept), on “Adventures with types
in Haskell”. My plan is:
**1. **Type classes
On Tue, Aug 14, 2012 at 8:44 AM, Michael Snoyman mich...@snoyman.com wrote:
An example that came up at work (with Yitzchak Gale, he probably has more
details) was essentially two different types of documents that shared a lot
of the same kinds of elements (tables, lists, paragraphs, etc) but
Am 12.08.2012 21:57, schrieb Ian Lynagh:
We are pleased to announce the first release candidate for GHC 7.6.1:
http://www.haskell.org/ghc/dist/7.6.1-rc1/
This includes the source tarball, installers for 32bit and 64bit
Windows, and bindists for amd64/Linux, i386/Linux, amd64/OSX and
The update analysis developed by Keith Wansbrough was very complicated, and
although rather beautiful (read his thesis and our papers), it didn't pay its
way in terms of complexity.
Coincidentally, Ilya Sergey is here on an internship and is now working on a
cheap and cheerful update analysis
On Tue, Aug 14, 2012 at 03:47:18PM +0200, Christian Maeder wrote:
Am 12.08.2012 21:57, schrieb Ian Lynagh:
We are pleased to announce the first release candidate for GHC 7.6.1:
http://www.haskell.org/ghc/dist/7.6.1-rc1/
This includes the source tarball, installers for 32bit and
We use a form of stream transducer here at Capital IQ that uses GADTs, kind
polymorphism and data kinds:
data SF k a b
= Emit b (SF k a b)
| Receive (k a (SF k a b))
data Fork :: (*,*) - * - * where
L :: (a - c) - Fork '(a, b) c
R :: (b - c) - Fork '(a, b) c
type Pipe = SF (-)
type Tee
On Tue, Aug 14, 2012 at 10:32 AM, Edward Kmett ekm...@gmail.com wrote:
data NonDetFork :: (*,*) - * - * where
NDL :: (a - c) - NonDetFork '(a, b) c
NDR :: (b - c) - NonDetFork '(a, b) c
NDB :: (a - b) - (b - c) - NonDetFork '(a, b) c
er..
NDB :: (a - *c*) - (b - c) - NonDetFork '(a,
Am 14.08.2012 14:48, schrieb Felipe Almeida Lessa:
data AccessToken kind where
UserAccessToken :: UserId - AccessTokenData - UTCTime -
AccessToken UserKind
AppAccessToken :: AccessTokenData - AccessToken AppKind
data UserKind
data AppKind
(Yes, that could be a data
2012/8/14 Christian Maeder christian.mae...@dfki.de:
Why not use plain h98?
data UserAccessToken = UserAccessToken UserId AccessTokenData UTCTime
data AppAccessToken = AppAccessToken AccessTokenData
type AccessToken = Either UserAccessToken AppAccessToken
Convenience. It's better to
Lennart Augustsson has a really interesting example of using GADTs and
the Maybe monad to validate an untyped AST into a typed,
(mostly-)correct-by-construction AST here:
http://augustss.blogspot.com/2009/06/more-llvm-recently-someone-asked-me-on.html
This was one of my first exposures to GADTs
* Simon Peyton-Jones simo...@microsoft.com [2012-08-14 11:32:19+]
This message is to invite you to send me your favourite example of
using a GADT to get the job done. Ideally I'd like to use examples
that are (a) realistic, drawn from practice (b) compelling and (c)
easy to present
Most academic papers do use the eval example, but it is a practical example.
This use of GADTs is nice for embedded languages. For example, Accelerate uses
a supercharged version of it to catch as many errors as possible during Haskell
host program compile-time (as opposed to Accelerate compile
On 07/18/2012 07:25 PM, Simon Peyton-Jones wrote:
Folks
Mikhail has improved Template Haskell’s handling of INLINE pragmas,
SPECIALISE pragmas, and RULES. I plan to commit his patch:
http://hackage.haskell.org/trac/ghc/ticket/7064
Will the patch make it to 7.6? I have 6 unpublished libraries
17 matches
Mail list logo
