Re: [Haskell-cafe] Is Haskell a Good Choice for Web Applications? (ANN: Vocabulink)

2009-05-06 Thread FFT
On Wed, May 6, 2009 at 8:20 PM, Anton van Straaten wrote: > The app is written for a client under NDA, so a blog about it would have to > be annoyingly vague. > No doubt the potential for encountering space leaks goes up as one writes > less pure code, persist more things in memory, and depend o

Re: [Haskell-cafe] Is Haskell a Good Choice for Web Applications? (ANN: Vocabulink)

2009-05-06 Thread FFT
I've heard it's hard to contain a long-running Haskell application in a finite amount of memory, but this is probably not a problem if your web site sleeps 0.001% of the time (like XMonad), or you can restart it every once in a while without anyone noticing.

Re: [Haskell-cafe] Best text editor

2009-04-13 Thread FFT
Has anyone tried Yi? On Sun, Apr 12, 2009 at 11:23 PM, Melanie_Green wrote: > > Hi I would like to follow the crowd and find out what text editor everyone > uses for haskell on windows. > > Thx in advanced > -- > View this message in context: > http://www.nabble.com/Best-text-editor-tp23018470p2

[Haskell-cafe] WX: linking to system libraries statically

2009-04-09 Thread FFT
I noticed that even simple WX demos like "Layout" are linked dynamically against 59 libraries on Linux. This would make distributing the binaries a nightmare. Is there a simple way to make a (mostly) statically linked binary? ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] GHC needs a 64 bit machine to be fast?

2009-04-08 Thread FFT
On Wed, Apr 8, 2009 at 3:21 AM, Roel van Dijk wrote: >> Suspiciously, "ghc -O2  --make" is almost as fast at 24.438s (6.10.2) > > You have to be careful when recompiling with a different -O setting > that you first remove all intermediate files (.o and .hi). I think > that GHC only looks at the so

Re: [Haskell-cafe] GHC needs a 64 bit machine to be fast?

2009-04-08 Thread FFT
Update: I missed an earlier blog post and the discussion that followed it. http://donsbot.wordpress.com/2008/05/06/write-haskell-as-fast-as-c-exploiting-strictness-laziness-and-recursion/ On 32-bit machines, -fexcess-presision makes GHC output faster (only 2 times slower than C instead of 5-10, i

Re: [Haskell-cafe] GHC needs a 64 bit machine to be fast?

2009-04-08 Thread FFT
On Wed, Apr 8, 2009 at 1:14 AM, Karel Gardas wrote: > > Hello, > > perhaps you are hit by following issue? > http://hackage.haskell.org/trac/ghc/ticket/594 The benchmark isn't using the native code generator, it compiles via C, as I understand. What are other people's timings on 32 bit Linux mac

[Haskell-cafe] GHC needs a 64 bit machine to be fast?

2009-04-08 Thread FFT
Not that this is a very good benchmark, but I compiled the nearly equivalent C and Haskell (1st, recursive version) programs from this blog post: http://donsbot.wordpress.com/2008/06/04/haskell-as-fast-as-c-working-at-a-high-altitude-for-low-level-performance/ There, in both versions, 1e9 iterati

[Haskell-cafe] automatically inserting type declarations

2009-04-06 Thread FFT
I remember hearing about a Haskell mode for Vim, Emacs, Yi or VisualHaskell that inserts type declarations automatically (it's lazier to just check the type than to write it manually), but I can't remember any details. What editor mode / IDE was it? What do most people use with GHC on Linux? I'm m

Re: Re[2]: [Haskell-cafe] Questions about slow GC with STArray

2009-04-06 Thread FFT
On Mon, Apr 6, 2009 at 1:49 AM, Bulat Ziganshin wrote: >> Are those the only legal contents of STUArray? > > numbers, chars, vanilla pointers. UArray just mimics C arrays, after all > I haven't gotten to learning about them in detail yet, but my hope was that STUArray was like vector in C++, an

Re: [Haskell-cafe] Questions about slow GC with STArray

2009-04-06 Thread FFT
On Mon, Apr 6, 2009 at 1:10 AM, Bulat Ziganshin wrote: > you need to scan only boxes: if array just contains plain cpu-level > numbers, there is nothing to scan Are those the only legal contents of STUArray? ___ Haskell-Cafe mailing list Haskell-Cafe@h

[Haskell-cafe] Questions about slow GC with STArray

2009-04-06 Thread FFT
I've been following with interest the recent discussions on reddit about the extremely slow hash tables in Haskell compared to F# and OCaml, and as I understood it, this performance problem is caused by GC not liking mutable arrays http://hackage.haskell.org/trac/ghc/ticket/650 It appears from the

Re: [Haskell-cafe] high probability of installation problems and quality of the glorious implementation

2009-04-05 Thread FFT
On Sun, Apr 5, 2009 at 1:41 PM, Peter Verswyvelen wrote: > That is strange, I'm using Ubuntu myself, and I come from Windows so know > absolutely nothing about Linux whatsoever, but GHC 6.10.2 binary installed > without problems. Are you running 32-bit Ubuntu 8.04 ? /etc/lsb-release and /etc/iss

Re: [Haskell-cafe] high probability of installation problems and quality of the glorious implementation

2009-04-05 Thread FFT
On Sun, Apr 5, 2009 at 12:35 PM, John Dorsey wrote: > Once it's installed and working, GHC's a very decent compiler. My general null hypothesis is, as Alec Baldwin put it, that a loser is a loser, or a buggy project is buggy. If GHC is robust overall (which I'm yet to find out), why is the inst

[Haskell-cafe] high probability of installation problems and quality of the glorious implementation

2009-04-05 Thread FFT
I'm still learning Haskell and also evaluating whether I want to use the language in my work. It seems like a fascinating language so far (although I don't know if laziness will be a detriment later for me eventually), but I'm a bit worried about the overall quality of its GHC implementation. For

Re: [Haskell-cafe] The votes are in!

2009-03-24 Thread FFT
I demand a recount! The one that launches the missile should have won! 2009/3/24 Eelco Lempsink : > The results of the Haskell logo competition are in! > > You can view them at > http://www.cs.cornell.edu/w8/~andru/cgi-perl/civs/results.pl?num_winners=1&id=E_d21b0256a4fd5ed7&algorithm=beatpath > >

Re: [Haskell-cafe] Haskell Logo Voting has started!

2009-03-20 Thread FFT
If avoiding success at all costs is the goal, wouldn't having a cool logo be counter-productive? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] big discussion about Haskell on Reddit

2009-03-15 Thread FFT
I noticed that on Programming Reddit, where I lurk, there is a big discussion about the disconnect between how much Haskell is advocated there and the number of applications written in it. http://www.reddit.com/r/programming/comments/84sqt/dear_reddit_i_am_seeing_12_articles_in/ The difficulty of

Re: [Haskell-cafe] Re: MPI

2009-03-06 Thread FFT
On Fri, Mar 6, 2009 at 9:30 AM, Don Stewart wrote: > > http://haskell.org/haskellwiki/Applications_and_libraries/Concurrency_and_parallelism#Distributed_Haskell > These are all Haskell-derived languages, not libraries, right? ___ Haskell-Cafe mailing l

[Haskell-cafe] Re: MPI

2009-03-05 Thread FFT
On Wed, Mar 4, 2009 at 5:03 PM, FFT wrote: > Are MPI bindings still the best way of using Haskell on Beowulf > clusters? It's my feeling that the bindings stagnated, or are they > just very mature? What's the story with distributed memory multiprocessing? Are Haskell programm

[Haskell-cafe] MPI

2009-03-04 Thread FFT
Are MPI bindings still the best way of using Haskell on Beowulf clusters? It's my feeling that the bindings stagnated, or are they just very mature? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-caf

[Haskell-cafe] binary serialization

2009-03-04 Thread FFT
Is there a way to do binary serialization of Haskell values (in GHC, at least)? If you propose a method, what are its type safety and portability properties? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/ha