Emmanuel CHANTREAU on 2009-12-03 13:03:02 +0100:
In my futur program, it use a lot of binary trees with strings (words)
as leaf. There is just arround 1000 words and they will appear a lot of
times. The program will possibly consume a lot of process and memory
(it is a mathematics proover).
Justin Bailey on 2008-09-09 14:12:38 -0700:
2008/9/9 Pieter Laeremans [EMAIL PROTECTED]:
What 's the best equivalent haskell approach ?
thanks in advance,
Pieter
The preferred approach is to look at your code, figure out where you
are using tail (or could be calling something that uses
Patrick Surry on 2008-05-14 09:43:44 -0400:
Probably a silly question, but for me one of the nice things about
Haskell is that it's a lot like just writing math(s). But in contrast
to math you lose a lot of notational flexibility being limited to the
ascii character set in your source code.
Andrew Coppin on 2007-07-10 21:23:23 +0100:
Can somebody write a trivial (as in: small) program so I can test my CGI
stuff without having to actually install and configure Apache?
The Haskell wiki (http://www.haskell.org/) lists several web servers; one
appears to fit your needs of being
Albert Lee on 2007-04-09 10:46:14 +0800:
I want to ls the filenames of a directory.
[...]
and I write that in haskell:
-
import System.Posix
import System.IO
main = do
dp - openDirStream /
df - readDirStream dp
putStrLn df
closeDirStream dp
--
It
brad clawsie on 2007-03-05 20:30:24 -0800:
(3) The GPL has never been tested in court
http://www.fsf.org/news/wallace-vs-fsf
note that during this thread there was a note from a contributor
to promise to not sue a potentially infriging use. you should be
careful of such promises,
Chris Eidhof on 2007-01-25 22:04:18 +0100:
Yes, I'm curious too. For example, it would be great if we could
change a function that uses map almost automatically to a function
that does the map in parallel. Ofcourse it should be in the IO monad,
so maybe mapM would be a better choice to
Greg Fitzgerald on 2006-12-12 11:24:58 -0800:
I'd like to be able to reorganize my code and then verify that I didn't
change any functionality. That is, the old and new code have precisely the
same meaning.
Also, I'd like to be able to change a function and verify that efficiency
was the
Paul Moore on 2006-12-11 22:46:44 +:
What I *can* do, is to attempt to install one of the libraries that
looks closest to what I want (probably HDBC, because I'm familiar with
the Python DB-API). But I honestly have little or no idea how to start
- following the HDBC link on the Haskell
