federico.squartini:
> Sorry, I was very silly!
>
> This is the correct version of the program using the doFromto loop.
> And it runs fast! I hope there are no further mistakes.
> Thanks Axel.
>
> time ./IOMutUnbUnsafe
> 499
> real 0m0.708s
> user 0m0.573s
> sys 0m0.008s
Here's an improved ve
Atom, a high-level hardware description language embedded in Haskell,
compiles conditional term rewriting systems into conventional HDL.
New in this release:
- VHDL code generation (synthesis only, simulation directives not supported).
- Improved rule mutual exclusion analysis. Now, mutual e
Hi
Maybe this link is of interest to you:
http://wiki.di.uminho.pt/twiki/bin/view/Research/PURe/WebHome.
A tool called DrHylo, developed in the context of this project is available,
altough I don't know how suitable it could be for you:
http://wiki.di.uminho.pt/twiki/bin/view/Personal/Alcino/DrHyl
RSA-Haskell is a collection of command-line cryptography tools and a
cryptography library written in Haskell. It is intended to be useful
to anyone who wants to secure files or communications or who wants to
incorporate cryptography in their Haskell application.
Download and documentation are ava
> I'm looking for a tool that implements the source code transformation
> "replace recursion by catamorphism" (fold etc.).
> My application is that if the transformation succeeds,
> it implies that the program terminates. (roughly)
> I don't want to make a big research project out of this,
> rath
While scanning my Inbox I read 'fast' and 'array' in the context of
functional programming. Well, of course SaC instantly came to my mind (what
a surprise ;) ). So I did some measurements myself. I used your programs,
except that I increased the array size by a factor of 10. For the C++
version I
On 5/1/07, Federico Squartini <[EMAIL PROTECTED]> wrote:
Moreover there is not much literature on high performance Haskell programming
(tricks like unsafeWrite), at least organized in a systematic and concise way.
Look at: http://haskell.org/haskellwiki/Performance
regards,
Bas van Dijk
_
Dear all,
I'm looking for a tool that implements the source code transformation
"replace recursion by catamorphism" (fold etc.).
My application is that if the transformation succeeds,
it implies that the program terminates. (roughly)
I don't want to make a big research project out of this,
rath
On 5/1/07, Federico Squartini <[EMAIL PROTECTED]> wrote:
Thanks for the hints. It's a pity that (as far as I know) no one has
written a tutorial on those techniques, because I think it would be
appreciated. Some of them are quite involved and learning them just by
reading code is very time consum
I think another interesting data point would be for a C++ version
that uses the 'vector' data type from STL (Standard Template Library)
and using the vector indexing ops that do bounds-checking.
Regards,
Nikhil
___
Haskell mailing list
Haskell@haskell.
Thanks for the hints. It's a pity that (as far as I know) no one has
written a tutorial on those techniques, because I think it would be
appreciated. Some of them are quite involved and learning them just by
reading code is very time consuming.
Federico
__
Sorry, I was very silly!
This is the correct version of the program using the doFromto loop.
And it runs fast! I hope there are no further mistakes.
Thanks Axel.
time ./IOMutUnbUnsafe
499
real0m0.708s
user0m0.573s
sys 0m0.008s
--
federico.squartini:
>
>Of course I know that the list version is very unfair, but I
>wanted to see what was the trade off between elegance and
>speed.
>Regarding whether low level programming makes sense or not,
>I was just curious to see what are the limits of Haskell.
>Mo
Of course I know that the list version is very unfair, but I wanted to see
what was the trade off between elegance and speed.
Regarding whether low level programming makes sense or not, I was just
curious to see what are the limits of Haskell. Moreover there is not much
literature on high performa
On Tue, May 01, 2007 at 01:59:01PM +0200, Federico Squartini wrote:
> I was reading an old post where Hal Daume III was analyzing Haskell
> performance for arrays.
> He proposed a test program which initializes an array, reverse it a number
> of times, and sums the contents.
>
> So I wrote a c++ r
Frederico,
On Tue, 2007-05-01 at 13:59 +0200, Federico Squartini wrote:
> I was reading an old post where Hal Daume III was analyzing Haskell
> performance for arrays.
> He proposed a test program which initializes an array, reverse it a
> number of times, and sums the contents.
>
> So I wrote a
I was reading an old post where Hal Daume III was analyzing Haskell
performance for arrays.
He proposed a test program which initializes an array, reverse it a number
of times, and sums the contents.
So I wrote a c++ reference program, a naive haskell version using lists and
I also tweaked a litt
17 matches
Mail list logo
