? Is the
lack of speed all in the stdio I/O?
Is there a way to tell which benchmarks have no haskell entry?
John Atwood
--
Josef Svenningsson wrote:
Hi all.
Some days ago someone posted this url:
http://www.bagley.org/~doug/shootout/
which is a page benchmarking a number of different languages
for de-suguring of list comprehensions, see section 3.11 of the Haskell
Report: http://www.haskell.org/definition/
or, in this case:
area (Polygon vertices) = 0.5 * sum (concatMap ok l)
where
ok (Vertex x1 y1, Vertex x2 y2) = [(x1-x2)*(y1+y2)]
ok _ = []
l = zip vertices (tail
Wy not load the list as program? E.g.
list1 =
["word1"
,"word2"
,"word3"
]
list2 = words "word1 word2 word3"
list3 = words
"\
\ word1\
\ word2\
\ word3\
\"
John Atwood
-
Lars Lundgren wrot
Try Erik Meijer's home page:
http://www.cs.ruu.nl/~erik/
John Atwood
-
Chris Angus wrote:
Does anyone know where I can get some
information on Lambada.
I tried
http://windows.st-lab.cs.uu.nl/Lambada/
but got a 403 (not authorised to view page)
Cheers
in "The fastest Fourier Transform in the West":
http://www.fftw.org/
John Atwood
---
Simon Peyton-Jones wrote:
Does anyone know of a good source of tutorial material on
Haskell arrays? Anyone feel like typing something into
the Ha
or example VisualBasic (ie. not very visual :-)
(erik meijer
I'm aware of John Reekie's version [1] and I see another [2], but I
suspect you refer to yet another "Visual Haskell"; can you elaborate? Is
it "Visual" in the language sense, or the IDE sense?
John Atwood
--
Works for me under ghc4.05; for hugs you need to:
You have it right, except you need to
1) explicitly type test,
test:: Reader [Char] Char
2) have Reader derive Show
3) use the -98 option at startup
John Atwood
-
=?iso-8859-1?Q?Jos=E9_Romildo_Malaquias?= wrote
Looks like the Haskell wiki has been zeroed. Could someone reset it?
John Atwood
: _The impact of the lambda calculus_, at:
http://www.cs.kun.nl/~henk/papers.html
have you found The Haskell Bookshelf?
http://www.haskell.org/bookshelf/
John Atwood
---
Christopher Jeris wrote:
Hi Haskellers,
Could you suggest a good place
. 52-65)
online at:
http://www.informatik.fernuni-hagen.de/import/pi4/erwig/papers/abstracts.html
The last line of the abstract reads:
For example, depth-first-search expressed by a fold over a functional
graph has the same complexity as the corresponding imperative algorithm.
John Atwood
with their Squeak language. It compiles
concurrent UI channels into sequential C. The Paper's on Cardelli's home
page. In Haskell, one might use something like the R (resource) monad
from the latest edition of the "Gentle Introduction...".
John Atwood
of hugs98, and tcl/tk 8.2.
Any help would be appreciated.
Also, one note on getting it running under SunOS 5.6: making TclPrim.so
required uppercasing tclPrim.c
John Atwood
'.)
In comp.lang.tcl, there's a thread on tcl and cygwin tools, also on
DLL's and VC++ vs. Borland compilers. One scary statement was seen:
The DLL in Borland is different from the VC++. I guess you may check it
if there is the "C" prefix and __dllexport.
John Atwood
orders of magnitude.
Speed is not the only issue, but it definitely is _an_ issue.
Another issue is correctness. What can be said about the correctness
of the C++ program? the haskell program? What theorems do we get
for free with this haskell program?
John Atwood
to me that
many of the pieces are there.
How many clocks are there in a quarter note?
Look in the file HaskToMidi.lhs
John Atwood
15 matches
Mail list logo
