I got confused by the GHC documentation recently, I was wondering how
it could be improved. From:
http://www.haskell.org/ghc/docs/latest/html/users_guide/bang-patterns.html
> A bang only really has an effect if it precedes a variable or wild-card
> pattern:
> f3 !(x,y) = [x,y]
> f4 (x,y) = [x,y
Here's the reference
http://portal.acm.org/citation.cfm?id=96748
"Deciding ML typability is complete for deterministic exponential
time" -- Harry G. Mairson.
Ben.
On 27/02/2009, at 10:12 AM, Ben Franksen wrote:
Hi
the attached module is a much reduced version of some type-level
assura
claus.reinke:
> Looking at prelude/PrelRules.hs has reminded me of an old
> conundrum: if I switch from Int to Word, should I expect any
> performance differences?
>
> A while ago, I needed lots of fairly small positive numbers,
> together with a small number of flags for each, so I thought
> I'd s
Just Hindley-Milner type inference is exponential, making the type
system more complex isn't going to make things better.
2009/2/26 Ben Franksen :
> Hi
>
> the attached module is a much reduced version of some type-level assurance
> stuff (inspired by the Lightweight Monadic Regions paper) I am tr
Looking at prelude/PrelRules.hs has reminded me of an old
conundrum: if I switch from Int to Word, should I expect any
performance differences?
A while ago, I needed lots of fairly small positive numbers,
together with a small number of flags for each, so I thought
I'd switch from Int to Word, an
Hi
the attached module is a much reduced version of some type-level assurance
stuff (inspired by the Lightweight Monadic Regions paper) I am trying to
do. I am almost certain that it could be reduced further but it is late and
I want to get this off my desk.
Note the 4 test functions, test11 .. t
but if we unfold a loop combinator at compile time, GHC's
normal optimizations can take over from there):
http://www.haskell.org/pipermail/haskell-cafe/2009-February/056241.html
Just a note - there is a solution that doesn't require Template
Haskell which I use in my own code. Here is a sketch:
| II is where I'd like to be able to distinguish variables, constants,
| and complex expressions in the left-hand sides of RULES, and
| I and III are where I'd like control over the rewrite strategy, as
| in strategy combinators.
I'm deep in icfp submissions, so no time to reply properly.
Okay
2009/2/24 Claus Reinke :
> In the recently burried haskell-cafe thread "speed: ghc vs gcc",
> Bulat pointed out some of the optimizations that GHC doesn't
> do, such as loop unrolling. I suggested a way of experimenting with loop
> unrolling, using template haskell to bypass GHC's blindspot (it usu
| II is where I'd like to be able to distinguish variables, constants,
| and complex expressions in the left-hand sides of RULES, and
| I and III are where I'd like control over the rewrite strategy, as
| in strategy combinators.
I'm deep in icfp submissions, so no time to reply properly.
You can
Hi,
I've got the following code:
import Control.Exception
import System.Cmd
main = system "sleep 1m" `finally` putStrLn "goodbye"
When compiled with GHC 6.10.1.20090225, if I hit Ctrl-C during the
sleep, I get the goodbye printed twice. If I leave evaluation to
finish normally I get goodbye once
11 matches
Mail list logo
