Excerpt from the documentation at
http://www.cs.chalmers.se/~nad/software/ChasingBottoms/docs/:
Chasing Bottoms
===
Do you ever feel the need to test code involving bottoms (e.g. calls to
the error function), or code involving infinite values? Then this library
could be useful for you
--- Gour <[EMAIL PROTECTED]> wrote:
> Any comment from some experienced Haskell
programmer
> about the latest
> language shootout published on:
>
> http://shootout.alioth.debian.org/index.php
> regarding Haskell (ghc-6.2.1) score?
I would have liked to re-implement some of the
benchmarks, some of
> The guts of the question is: can one use the class system to code up
> the reflexive, transitive closure
Computing the transitive closure of types is possible:
http://www.haskell.org/pipermail/haskell-cafe/2003-October/005249.html
http://www.haskell.org/pipermail/haskell-cafe/2003-November/0054
hi,
of course it is not a _language_ shootout, but rather _language
implementation_ shootout
(actually not even that..., and yes, i agree that some of the tests are
silly, or even non-sensical, e.g. list processing)
it still has some interesting results though. for example it points out
where
On 18/06/2004, at 10:49 PM, Gour wrote:
Any comment from some experienced Haskell programmer about the latest
language shootout published on:
http://shootout.alioth.debian.org/index.php
Yeah. Language shootouts are nearly worthless. (And I say that as an
experienced Haskell programmer who uses a
Hello all,
I was just wondering if anyone had any ideas on how I could create an
expression type to produce strings of some sort. So say I have something like (Exp a)
`oper` (Exp b), is there a way I could perform some operation on each left/right
expression, and then on the whole expre
On 18 June 2004 13:50, Gour wrote:
> Any comment from some experienced Haskell programmer about the latest
> language shootout published on:
>
> http://shootout.alioth.debian.org/index.php
>
> regarding Haskell (ghc-6.2.1) score?
I submitted improved versions for some of the benchmarks.
My f
Any comment from some experienced Haskell programmer about the latest
language shootout published on:
http://shootout.alioth.debian.org/index.php
regarding Haskell (ghc-6.2.1) score?
Sincerely,
Gour
--
Gour| [EMAIL PROTECTED]
Registered Linux User | #278493
GPG Public Key
Johannes,
the result of an application 'normal x' is always true ...
I understand how this works,
but do we agree that it looks outright ugly?
I don't see why
f x | normal x = ... x ...
is any more ugly than
f x@(x : xs) = ... x ...
or (far worse)
f ~(x : xs) = ... x ...
or strictness annotations,
Colin, Arjan, one further remark on
hyperseq x y = if x==x then y else error "this is very unlikely"
...
the result of an application 'normal x' is always true ...
I understand how this works,
but do we agree that it looks outright ugly?
We mean one thing (strictness)
but we write something quite d
Arjan,
I supervise a student who uses Haskell for simulating neural nets. A lot of
computation goes on there and the program cannot handle as many iterations
as we would like. We have improved performance by a factor of more than ten
by putting strictness annotations in all data types. But the prob
At 15:33 17/06/04 -0700, John Meacham wrote:
I think it was a couple things, Pattern guards were introduced which
were conceptually a whole lot simpler and provided a way to do many of
the things views did.
http://research.microsoft.com/~simonpj/Haskell/guards.html
I like that proposal.
In response
The Haskell bookstore is now open :)
The bookstore is an attempt to publish out-of-print books, scientific
papers, and technical documentation relating to Haskell and Functional
Programming in general which is not otherwise available in print.
At the moment, the shop has
* Simon Peyton Jones an
On Fri, Jun 18, 2004 at 11:17:52AM +0200, Peter Simons wrote:
> Tomasz Zielonka writes:
>
> >> http://cryp.to/hsdns/
>
> > You stole my project's name!
>
> I have to admit that I am uncertain whether you are kidding
> or whether this is a serious complaint, but in case of the
> latter, I'll ch
Tomasz Zielonka writes:
>> http://cryp.to/hsdns/
> You stole my project's name!
I have to admit that I am uncertain whether you are kidding
or whether this is a serious complaint, but in case of the
latter, I'll change the name to HsADNS or whatever. I can't
say I am emotionally invested in ho
I am pleased to announce that the following papers have been accepted
for
ICFP 2004 (http://www.cs.indiana.edu/icfp04/). In addition, Paul
Graham,
John Launchbury, and Ulf Wiger have graciously agreed to give invited
talks.
The final program will be available from the web site mid-July.
Kathle
==
LAST CALL FOR PAPERS
CLIMA V
Fifth International Workshop on Computational Logic in Multi-Agent Systems
September 29 and 30, 2004, Lisbon, Portugal
http
Vivian McPhail wrote:
Hi,
I've implemented a Neural Net simulator which needs to repeat a training loop many times. For this I used a while function:
while test body = do
(cond,res) <- body
if (test cond) then do rs <- while test body
18 matches
Mail list logo
