On 21-Mar-2000, Sven Panne <[EMAIL PROTECTED]> wrote:
> Example: length is strict in its argument, but the following
> function is hyperstrict (at least according to my definition :-) :
>
>len :: Eq a => [a] -> Int
>len [] = 0
>len (x:xs) | x == x = 1 + len xs
>
> This 'x == x' is fo
George Russell <[EMAIL PROTECTED]> wrote,
> "Manuel M. T. Chakravarty" wrote:
> > IMHO it would be much more important to think about a
> > mechanism for automatically extracting all the interface
> > information (including the interface comments) from a
> > Haskell module. Something like an au
Hello.
I've made an interface to the MySQL database management system. I'm
releasing it under the LGPL.
Homepage:
http://www.volker-wysk.de/mysql-hs
bye
"Andreas C. Doering" <[EMAIL PROTECTED]> wrote,
> > [1] admittedly not many. Are people using Haskell having problems
> > getting good enough performance? Enough to regret choosing it as a
> > language? (This is not a rhetoric question!)
> No and yes.
> I use Haskell mainly for combinational p
| In that regard, I think the biggest problems remaining are the lack of a
| standard "fast" string type, and some remaining warts in hugs. These are
| maybe easiest to see when you do something like "strace -c" on a hugs
| program and the comparable perl program. So, in my naive version of
| "h
Tue, 21 Mar 2000 12:31:39 +0100, Jan Brosius <[EMAIL PROTECTED]> pisze:
> > So the first line won't typecheck, and the question whether the last
> > line would typecheck if the first line would becomes irrelevant.
>
> I think it is relevant,
I don't remember what the paper said, but you must ty
Post-Doctorate Research Position
Yale University
Department of Computer Science
The Yale Haskell Project (http://haskell.org/yale) in the Department of
Computer Science at Yale University is seeking applicants for a
Post-Doctoral Research Positi
Jan de Wit wrote:
> I think hyperstrict means that a function completely evaluates *all*
> of its arguments before the body of the function, as opposed to only
> some of them. [...]
Hmm, at the moment I've got no cunning books around, but my
understanding of `hyperstrict' was the following: A fun
Hi All,
> I find this interesting. It would be nice if you would like to explain me
> what you mean by " hyperstrict"
>
I think hyperstrict means that a function completely evaluates *all* of its
arguments before the body of the function, as opposed to only some of
them.
A function f taki
On 21 Mar 2000, Ketil Malde wrote:
> "Jan Brosius" <[EMAIL PROTECTED]> writes:
>
> >> But this example task was chosen as unlucky for Haskell.
> >> In other, average case, I expect the ratio of 6-10.
>
> > This seems that Haskell cannot be considered as a language for real
> > world applicati
Jonathan King <[EMAIL PROTECTED]> writes:
>Lout is a powerful language which allows you to place text or
>graphics at a specific point on the page
I'll just point out that these capabilities are *not* what one wants
to have in comments. I think we rather want *semantic* markup.
-kzm
-
On Tue, 21 Mar 2000, Jan Brosius wrote:
> > Jonathan King <[EMAIL PROTECTED]> wrote:
>
> > (Well, the person touting lout seemed to ignore the HTML
> > requirement...)
>
> I invite you to look at he following website
>
> http://www.ptc.spbu.ru/~uwe/lout/lout.html
But, of course, I had. When
Since we're debating literate programming and embedded documentation,
I wonder what is the point, what are we trying to achieve?
Is it to
a) write books or papers containing pieces of code?
b) add some formatting and functionality to comment blocks?
c) make source code easier to navigate and un
In the vein of benchmarking,
For those of you who follow comp.arch (or am I the only one?), you
have probably noticed the discussion about Stalin vs. C compilers.
For those who don't, it's basically one particular Scheme program
where compiled Scheme beats a naïve rewrite in C with orders of
mag
Jan Brosius writes:
> Recent (really recent ) benchmarks are not available ont the
> Haskell website as far as I know
Yes, it would be nice to see some recent benchmarks and interlanguage
comparisons reported in an article. The pseudoknot article is already very
outdated, and Clean in particula
"Andreas C. Doering" wrote:
...
> I would love to get higher performance without much effort.
> For one result I had to wait for over a week, ...
So do I, so do I!
Twice I had to wait 9 months. But the results are nice.
Jerzy Karczmarczuk
Caen, France
"Jan Brosius" <[EMAIL PROTECTED]> writes:
> NO, NO and NO , please read only what I have written.
You mean, apart from
>>> This seems that Haskell cannot be considered as a language for real
>>> world applications but merely as a toy for researchers .
? I could have sworn you were saying her
- Original Message -
From: Jonathan King <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, March 20, 2000 10:23 PM
Subject: Re: HaskellDoc?
> (Well, the person touting lout seemed to ignore the HTML requirement...)
I invite you to look at he following website
http://www.ptc.s
- Original Message -
From: Ch. A. Herrmann <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, March 20, 2000 7:23 PM
Subject: RE: speed of compiled Haskell code.
> Hi,
>
> Jan> Haskell code optimised by strictnes annotions in functions or
> Jan> in datastructures are ? ti
> ( By the way several (not all) compressed archived papers
> could not be opened by my Winzip program (I use Windows NT ))
I had this problem, too. I have found that Internet Explorer
automatically decompresses .gz-files, but does not remove the extension.
A easy workaround is to rename the file
- Original Message -
From: Ketil Malde <[EMAIL PROTECTED]>
To: Jan Brosius <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>; S.D.Mechveliani <[EMAIL PROTECTED]>
Sent: Tuesday, March 21, 2000 10:14 AM
Subject: Re: speed of compiled Haskell code.
> "Jan Brosius" <[EMAIL PROTECTED]> writes:
>
>
- Original Message -
From: Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, March 20, 2000 8:58 PM
Subject: Re: Fw: a problem concerning a paper
> Mon, 20 Mar 2000 14:59:26 +0100, Jan Brosius
<[EMAIL PROTECTED]> pisze:
>
> > > let v = runst (newVar
> [1] admittedly not many. Are people using Haskell having problems
> getting good enough performance? Enough to regret choosing it as a
> language? (This is not a rhetoric question!)
No and yes.
I use Haskell mainly for combinational problems in research.
I would love to get higher performanc
"Jan Brosius" <[EMAIL PROTECTED]> writes:
>> But this example task was chosen as unlucky for Haskell.
>> In other, average case, I expect the ratio of 6-10.
> This seems that Haskell cannot be considered as a language for real
> world applications but merely as a toy for researchers .
Yeah. L
"D. Tweed" <[EMAIL PROTECTED]> writes:
>> "Ch. A. Herrmann" wrote:
>>> I believe that if as much research were spent on Haskell compilation as
>>> on C compilation, Haskell would outperform C.
> Unless I've got a dramatically distorted view of the amount of research
> that goes on for impera
25 matches
Mail list logo
