As one of the authors of this paper, I'd like to echo Manuel's warning
about quoting out of context. The paper is about Haskell as a tool in
designing and presenting algorithms, not about performance. The Haskell
program was written for clarity, to explain a fairly tricky algorithm. The
figures
"Jonathan" == Jonathan King [EMAIL PROTECTED] writes:
Jonathan On Thu, 23 Sep 1999, Manuel M. T. Chakravarty wrote:
[EMAIL PROTECTED] (Marcin 'Qrczak' Kowalczyk) wrote,
S.D.Mechveliani [EMAIL PROTECTED] pisze:
So far, no clear progrm example appeared in this list to demonstrate
[EMAIL PROTECTED] (Marcin 'Qrczak' Kowalczyk) wrote,
S.D.Mechveliani [EMAIL PROTECTED] pisze:
So far, no clear progrm example appeared in this list to demonstrate
Haskell's in-efficiency in comparison to other languages.
I have not done benchmarking myself yet, but in
Thu, 23 Sep 1999 14:19:54 +0900, Manuel M. T. Chakravarty [EMAIL PROTECTED]
pisze:
The fact that the given URL simply produces a "not found" error
message on my machine,
I am sorry, I didn't know it was no longer there. I am putting it in
http://kki.net.pl/qrczak/bridging.ps.gz
PS: I am
On Thu, 23 Sep 1999, Manuel M. T. Chakravarty wrote:
[EMAIL PROTECTED] (Marcin 'Qrczak' Kowalczyk) wrote,
S.D.Mechveliani [EMAIL PROTECTED] pisze:
So far, no clear progrm example appeared in this list to demonstrate
Haskell's in-efficiency in comparison to other languages.
I have
Juergen Pfitzenmaier [EMAIL PROTECTED] wrote
P I dont't care very much how fast a program runs. I care about how
P long it takes me to write it. If you take a programming task of
P reasonable complexity you will finish *months* earlier using a
P --good-- functional language instead of C++.
P
P
Wed, 22 Sep 1999 14:26:03 +0400 (MSD), S.D.Mechveliani [EMAIL PROTECTED] pisze:
So far, no clear progrm example appeared in this list to demonstrate
Haskell's in-efficiency in comparison to other languages.
I have not done benchmarking myself yet, but in
S.D.Mechveliani wrote:
Thus, the recent example with the Cryptarithm solver was a very
in-correct comparison, due to the unknown permutation generating
order.
I did not study the problem in detail, but I think giving it
an unsolvable puzzle would force it to try *all* permutations,
thus
