PS I have always installed ghc first via the Ubuntu package installer
followed by a build from ghc 6.8.2 source!
Vasili
On Sat, May 17, 2008 at 12:01 AM, Galchin, Vasili [EMAIL PROTECTED]
wrote:
ghc-pkg list gives me
[EMAIL PROTECTED]:~$ ghc-pkg list
On Sat, May 17, 2008 at 1:24 AM, Kim-Ee Yeoh [EMAIL PROTECTED] wrote:
Dan Piponi-2 wrote:
In fact, you can use the Reader monad as a fixed size container monad.
Interesting that you say that. Reader seems to me more as an anti-container
monad.
You just have to think of the environment as
Don Stewart [EMAIL PROTECTED] writes:
mkAnn :: ByteString - Annotation
mkAnn = pick . B.words
where pick (_db:up:rest) = pick' up $ getGo rest
pick' up' (go:_:ev:_) = Ann (B.copy up') (read $ B.unpack go)
(read $ B.unpack ev)
getGo = dropWhile (not . B.isPrefixOf
Creighton Hogg wchogg at gmail.com writes:
Where could I find a proof that the initial algebras final coalgebras of CPO
coincide? I saw this referenced in the Bananas.. paper as a fact, but am
not
sure where this comes from
Creighton,
As promised and I hope this is what you were after.
Vasili,
I have pretty much exactly the same set up as you seem to have. I
haven't had a single problem with running configure using cabal. In
what sense does it stop working?
Cheers,
Josef
2008/5/17 Galchin, Vasili [EMAIL PROTECTED]:
PS I have always installed ghc first via the Ubuntu package
Josef,
Did you consistently only use the Ubuntu package manager to install
and upgrade all ghc tools including the compiler, cabal?Or did you ever
build the ghc compiler from source on your system on top of a Ubuntu package
installed ghc like I did?
Vasili
On Sat, May 17, 2008 at 5:01 AM,
Galchin, Vasili [EMAIL PROTECTED] wrote:
Did you consistently only use the Ubuntu package manager to
install and upgrade all ghc tools including the compiler, cabal?Or
did you ever build the ghc compiler from source on your system on top
of a Ubuntu package installed ghc like I did?
On
Token.hs:103:15:
Overlapping instances for Show (SourcePos, Tok)
arising from a use of `anyToken' at Token.hs:103:15-22
Matching instances:
instance (Show a, Show b) = Show (a, b) -- Defined in GHC.Show
instance [overlap ok] Show Token
-- Defined at
Hi folks.
OK, try this:
darcs get http://darcs.orphi.me.uk/MyMD5
cd MyMD5
ghc -O2 --make md5sum
md5sum some large filename
On my PC, it takes 3.5 seconds to compute the MD5 hash of a 10 MB file.
For comparison, the md5.exe I downloaded from the Internet does it
instantaneously. It's
Hello Andrew,
Saturday, May 17, 2008, 6:51:27 PM, you wrote:
If anybody has any interesting insights as to why my version is so
damned slow, I'd like to hear them.
i equally will be interesting to hear why you think what your program
should be as fast as C version? you wrote it in purely
Andrew,
I spent a reasonable amount of time making pureMD5 (available on
hackage) faster, which mainly ment strictness annoitations and unboxing
strict fields, but I also spent a good deal of time with the profiler.
One of my early versions was fairly slow due to the converting of the
LPS to
On Sat, 2008-05-17 at 15:12 +0200, Achim Schneider wrote:
Token.hs:103:15:
Overlapping instances for Show (SourcePos, Tok)
arising from a use of `anyToken' at Token.hs:103:15-22
Matching instances:
instance (Show a, Show b) = Show (a, b) -- Defined in GHC.Show
Hi everybody,
I was doing an assignment in Java for my university concerning a program
that reads, modifies and writes CSV files, when I suddenly had the idea
of implementing parts of this in Haskell for fun.
When I finished the Haskell programm, I was disappointed by the performance:
To
Jeroen,
isPrime :: Int - Bool
isPrime x = isPrime' x primes
where isPrime' x (p:ps) | x == p = True
| x p = isPrime' x ps
| otherwise = False
main = print $ length (filter (== True) (map isPrime [1..5000]))
[...]
isPrime x =
On Sat, May 17, 2008 at 8:19 PM, Jeroen [EMAIL PROTECTED] wrote:
Hi, I know there's been quite some performance/optimization post lately,
so I hope there still room for one more. While solving a ProjectEuler
problem (27), I saw a performance issue I cannot explain. I narrowed it
down to the
Philip Müller [EMAIL PROTECTED] wrote:
I have read Don's blog post but am unsure how to implement his tips
into my program, as I am still kind of a Haskell beginner.
Dan, you seem to have opened a big can of worms. If Haskell is
successful, it's your fault.
Without doing any compiling,
Am Samstag, 17. Mai 2008 19:52 schrieb anton muhin:
On Sat, May 17, 2008 at 8:19 PM, Jeroen [EMAIL PROTECTED] wrote:
Hi, I know there's been quite some performance/optimization post lately,
so I hope there still room for one more. While solving a ProjectEuler
problem (27), I saw a
Andrew Coppin [EMAIL PROTECTED] writes:
Look closer: it's hardER to read.
mean xs = sum xs / fromIntegral (length xs)
mean = go 0 0 n
where
go s l x
| x m = s / fromIntegra l
| otherwise = go (s+x) (l+1) (x+1
One version makes it instantly clear, at a glance,
Hello,
Common Lisp is a multiparadigm, general purpose programming language
that supports imperative, functional, and object-oriented programming
paradigms. Haskell is purely functional. Is this a reason why there
is not macro feature in Haskell? I feel the object-oriented paradigm
of
On 2008 May 17, at 14:52, D. Gregor wrote:
Common Lisp is a multiparadigm, general purpose programming language
that supports imperative, functional, and object-oriented
programming paradigms. Haskell is purely functional. Is this a
reason why there is not macro feature in Haskell? I
allbery:
On 2008 May 17, at 14:52, D. Gregor wrote:
Common Lisp is a multiparadigm, general purpose programming language
that supports imperative, functional, and object-oriented programming
paradigms. Haskell is purely functional. Is this a reason why there is
not
On Sat, May 17, 2008 at 3:16 PM, Don Stewart [EMAIL PROTECTED] wrote:
allbery:
On 2008 May 17, at 14:52, D. Gregor wrote:
Common Lisp is a multiparadigm, general purpose programming language
that supports imperative, functional, and object-oriented programming
paradigms.
I have question on mapping some Haskell concepts to C# 3 ones. Maybe there
are not any strict equivalents; yet it helps:
1 - What is the equivalent of Type Constructor in C#?
2 - What is the equivalent of Data Constructor in C#?
3 - What is the logical implementation of pattern matching in C#?
2008/5/17 Kaveh Shahbazian [EMAIL PROTECTED]:
I have question on mapping some Haskell concepts to C# 3 ones. Maybe there
are not any strict equivalents; yet it helps:
1 - What is the equivalent of Type Constructor in C#?
Class declaration. Generic ones. E.g. Listint, is a type where the
hello,
the new version of haddock (2.0.0) needs a new option -B that tells
it the GHC lib directory. How do I find out the correct value for this
option in a makefile, so that the makefile stays portable?
Cheers,
Misha
___
Haskell-Cafe mailing
On 5/2/08 8:50 PM, Vimal wrote:
On 03/05/2008, Keith Fahlgren [EMAIL PROTECTED] wrote:
Hi,
Our next BayFP meeting will be this Thursday, May 8th, 2008 at 7:30pm.
We'll feature Bryan O'Sullivan on Concurrent and multicore programming
in Haskell. Bryan is a co-author of the upcoming O'Reilly
On Sat, May 17, 2008 at 10:40 PM, Daniel Fischer
[EMAIL PROTECTED] wrote:
Am Samstag, 17. Mai 2008 19:52 schrieb anton muhin:
On Sat, May 17, 2008 at 8:19 PM, Jeroen [EMAIL PROTECTED] wrote:
Hi, I know there's been quite some performance/optimization post lately,
so I hope there still room
On 2008 May 17, at 16:48, anton muhin wrote:
Why not -O3?
-O3 doesn't do anything over -O2 in ghc. -fvia-c -optc-O3 *might* be
an improvement, or might not.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL PROTECTED]
system administrator [openafs,heimdal,too many hats]
On 2008.05.17 21:54:53 +0200, Misha Aizatulin [EMAIL PROTECTED] scribbled
0.2K characters:
hello,
the new version of haddock (2.0.0) needs a new option -B that tells it
the GHC lib directory. How do I find out the correct value for this option
in a makefile, so that the makefile stays
On Sat, May 17, 2008 at 5:22 PM, Philip Müller
[EMAIL PROTECTED] wrote:
If someone here finds the time to look at my code and give me some hints,
that would really be nice.
A little experimentation reveals that your main bottleneck is readCSVLine:
readCSVLine = read . (\x - [ ++ x ++ ])
(I
Maybe you could do something like call out to a shell and ask it to run
'ghc --print-libdir'? That for me prints to stdout a string like
'/usr/lib64/ghc-6.8.2'.
Yes, this looks like a solution. Thanks a lot!
___
Haskell-Cafe mailing list
Am Samstag, 17. Mai 2008 22:48 schrieb anton muhin:
Why not -O3?
As far as I know - and Brandon S.Allbery said so, too - -O3 isn't better than
-O2.
Using a real list of primes,
What's the size of the real list?
arbitrary, however, since it's [Int], it will actually be at most 105097565
Hi Josef,
What generates dist/setup-config? When I run runhaskell Setup.hs
configure, nothing including dist/setup.config gets generated. ??
Regards, Vasili
On Sat, May 17, 2008 at 11:02 AM, Josef Svenningsson
[EMAIL PROTECTED] wrote:
On Sat, May 17, 2008 at 1:00 PM, Galchin, Vasili
[EMAIL PROTECTED]:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell
Setup.lhs configure --prefix=$HOME
Configuring mlock-1.0...
[EMAIL PROTECTED]:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell
Setup.lhs build
Setup.lhs: error reading dist/setup-config; run setup configure command?
No
Daniel Fischer daniel.is.fischer at web.de writes:
Am Samstag, 17. Mai 2008 22:48 schrieb anton muhin:
Why not -O3?
As far as I know - and Brandon S.Allbery said so, too - -O3 isn't better than
-O2.
Using a real list of primes,
What's the size of the real list?
arbitrary,
35 matches
Mail list logo
