#1288: ghci 6.6 foreign import stdcall broken, panic, panic
---+
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
#1288: ghci 6.6 foreign import stdcall broken, panic, panic
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
#1288: ghci 6.6 foreign import stdcall broken, panic, panic
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
#1288: ghci 6.6 foreign import stdcall broken, panic, panic
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Hello,
I have a package which links to several libraries, which I have built
with Cabal. I can use it to compile executables:
$ ghc -package vectro --make Vector/Sparse/subvec-example.hs -o sve
Linking sve ...
And the library references in those executables are correct:
$ /lib/ld-2.5.so --list
Hi,
Turned out that the configure script was detecting the system as
powerpc64-unknown-linux, but my assembler etc. didn't like the ppc64
assembler thrown out by StgCRun; rebuilding, forcing the configure to
think the ps3 was just a powerpc- worked fine. 8 hours later and I
now have a shiny new,
[Apologies if you receive this more than once]
#
IEEE/WIC/ACM WEB INTELLIGENCE 2007
CALL FOR PAPERS
#
2007 IEEE/WIC/ACM International
Donald Bruce Stewart wrote:
ahey:
Actually it isn't I'm afraid. That module has had a complete re-write
since the package was last cabalised. Anybody who's interested should
darcs get it from
http://darcs.haskell.org/packages/collections-ghc6.6/
Oh, what's remaining before the next release?
On Apr 21, 2007, at 2:54 AM, Donald Bruce Stewart wrote:
Just to walk the walk, and not just talk the talk, here's a quick unit
testing 'diff' driver I hacked up for QuickCheck.
Yay! I'll be the first to switch over!
Note that we actually probably want to use SmallCheck here,
I don't
On 4/21/07, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
chak:
Duncan Coutts wrote:
If anyone is interested in developing a Language.C library, I've just
completed a full C parser which we're using in c2hs.
It covers all of C99 and all of the GNU C extensions that I have found
used in
On Sat, 2007-04-21 at 12:04 +0200, Josef Svenningsson wrote:
Unfortunately the niche is not empty. There is an ocaml library called
cil which is supposed to be pretty sweet for manipulating C code. But
I still think a Haskell library would be a very good idea, and perhaps
one can look at cil
Dan Weston wrote:
-- Why is this not in Prelude?
dup x = (x,x)
It is (almost). It's called
join (,)
Regards,
apfelmus
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I think you are right. If you used something like a theorem prover as
an example, you accidentally send the messsage that Haskell is very
useful for esoteric stuff that only academics are interested in.
Now, that doesn't mean that the example has to solve a real problem,
but it does need to be
I now used GHC 6.4 and mingw ( MSYS-1.0.11 ). Now it is possible to
configure, build and install it. But on running the test ( out of a
email from the list, source code see below) it crashes again without any
information.
I compiled the Test1.hs with ghc -c Test1.hs.
Bayley, Alistair wrote:
seems Simon has got himself a tricky problem. i was about to hit reply to his
first call, but then i browsed through the oscon site, and thought that perhaps
my background isn't close enough to the intended audience to make useful
suggestions, not to mention the concrete examples asked for. but
Recently I read an interesting article by Peter Norvig[1] on how to
write a spelling corrector in 21-lines of Python. I wanted to try and
implement it in Haskell. My implementation is terribly slow and I was
hoping for some tips on how to improve it and make it idiomatic.
I'd love to see other
First, let me thank all the people who responded to my issue, it was
very helpful. I would have responded earlier but I was on a business
trip and out of contact for the last week.
On the bright side I used the time to re-work my implementation.
Instead of relying on Haskell's lazy evaluation,
Hi Pete,
Recently I read an interesting article by Peter Norvig[1] on how to
write a spelling corrector in 21-lines of Python. I wanted to try and
implement it in Haskell. My implementation is terribly slow and I was
hoping for some tips on how to improve it and make it idiomatic.
I had a
Pete Kazmier [EMAIL PROTECTED] writes:
I'd love to see other Haskell implementations as well if anyone has a
few moments to spare. Admittedly, it took me several hours to get my
version working, but I'm a Haskell newbie. Unfortunately, I think it
runs as slow as it took me to write it!
I try using WordSet = [String] (plus corresponding change in code) and
get great speedup, actually way more than 3x. There was also a memory
growth phenomenon using Set String, and replacement by [String] stops
that too, now it's constant space (constant = 20M). It is possible to
attribute
20 matches
Mail list logo
