On Mon, 11 Mar 2002, Simon Marlow wrote:
There seems to be a bug in the IO libraries. I'm using the following
procedure to call an external program and send it data through a pipe.
Could you send us a complete example that we can run to reproduce the
problem?
I've stripped down my
[mailing list trimmed]
Thanks Simon,
Explanation of why GreenCard generates that code attached.
Briefly, GreenCard has always marshalled Word8 as a Word32 (and so has
Hugs). I'm wondering if a recent change in GHC or in how Win32 is
compiled might have changed the way that Word32 is being
That is a shame. I tried both suggestions (specifying
position explicitly
and recompiling with fvia-c -- i had been using O all along)
and neither
worked :(.
I also tried using 5.03, and got the following warnings:
[ message deleted ]
It looks like there are some prototypes missing:
Lately, I've been attempting to improve the performance of a highly
numerically intensive program.
Yet try as I might I cannot seem to define (nor find) an addition function
that is strict in both its arguments.
Using the advice found in the GHC Users Guide I have looked inside the .hi
file and
Call for Papers
=
Microprocessor Test and Verification (MTV'02)
June 6-7, 2002, Austin, Texas, USA
http://ece.tamu.edu/MTV/
tor 2002-03-14 klockan 08.02 skrev Ketil Z. Malde:
Manuel M. T. Chakravarty [EMAIL PROTECTED] writes:
The detailed choice of colours is, of course, adjustable.
At least on a Unix machine, I am quite sure you can use
XEmacs also in batch mode to generate the HTML
Sure. Have a look at
At 22:47 13/03/02 -0600, Jay Cox wrote:
Perhaps what could be done about this strictness business is to make a
kind of strictness annotation. Perhaps something that says (force the
second argument of function F before every call to F (including any time F
calls itself)).
...
here's a rough
does there exist a program that'll take a layed out haskell
program and
output one that uses braces and semis to delimit?
You can use GHC's hssource package to parse then pretty-print the
source code - the pretty printer can generate output with explicit
layout tokens if you ask for it.
Can I use hugs98 on mij Linux SuSE7.0 computer?
If the awnser is yes, which files do I have to download?
Greetings,
J. Kops
Student University Utrecht (The Netherlands)
_
Download MSN Explorer gratis van
Hi!!! ^^
I am a student who study a computer programing.
I want to have Haskell software to study .
However, it is very hard to get the Haskell . and I hope you give me the way to get the Heskell.
If you mail me to show the way to get the Heskell , I would appreciate your kindness.
Thank
Hi,
Hugs (a Haskell interpreter) can be downloaded at
http://cvs.haskell.org/Hugs/pages/downloading.htm
Arjan
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi Jeroen,
Can I use hugs98 on mij Linux SuSE7.0 computer?
I think you can. Download hugs98-Dec2001.tar.gz under Generix Unix at
http://cvs.haskell.org/Hugs/pages/downloading.htm
and compile it yourself. How to do this, can be found in the file Install
inside the archive.
Greetings, Arjan
Robert Giegerich [EMAIL PROTECTED] wrote,
I often use Haskell demos in teaching algorithms. The problem is that this
does not integrate well with the rest of the material, e.g. lecture
notes or slides in PDF or HTML. I'd like to integrate explanations and
demos and explorative changes to
That is a shame. I tried both suggestions (specifying
position explicitly
and recompiling with fvia-c -- i had been using O all along)
and neither
worked :(.
I also tried using 5.03, and got the following warnings:
[ message deleted ]
It looks like there are some prototypes missing:
On Thu, Mar 14, 2002 at 03:05:34PM +1100, Manuel M. T. Chakravarty wrote:
Again, XEmacs with the above mentioned Haskell mode can do
it. Just execute the function `htmlize-buffer' on a buffer
containing the Haskell source. As an example for the
generated output, have a look at
2. When I hear translate to HTML I imagine that underlined
words which can be clicked to see, say, definition of
function. Sadly, most htmlizers are focused on highlighting
rather than navigation.
Why generate HTML pages if noone reads them?-)
Take this obscure location, for instance:
[Jay Cox [EMAIL PROTECTED]]
(+):: Num a = a - a - a therefore sum :: Num a = [a] - a - a
now, for any conceivable sum, you generally need both arguments to compute
it (or am I wrong?), so i guess you could say (+) should probably be
strict for both arguments. But how would you tell the
At 22:47 13/03/02 -0600, Jay Cox wrote:
Perhaps what could be done about this strictness business is to make a
kind of strictness annotation. Perhaps something that says (force the
second argument of function F before every call to F (including any time F
calls itself)).
...
here's a rough
On Thu, 14 Mar 2002, Andrew Butterfield wrote:
I think the Clean type system does stuff like this - it certainly supports
strictness analysis and annotations:
- see http://www.cs.kun.nl/~clean/ for more details
Thanks to both you and to Bernard James POPE for the replies.
The embarrasing
On Thu, 14 Mar 2002, Brian Huffman wrote:
In Haskell you can produce the desired behavior by using pattern guards.
Since the pattern guards always get evaluated before the result does, they
can be used to make things more strict. Here is the foldl example:
strict x = seq x True
foldl' ::
Max Kirillov [EMAIL PROTECTED] wrote,
On Thu, Mar 14, 2002 at 03:05:34PM +1100, Manuel M. T. Chakravarty wrote:
Again, XEmacs with the above mentioned Haskell mode can do
it. Just execute the function `htmlize-buffer' on a buffer
containing the Haskell source. As an example for the
On Wed, 13 Mar 2002, Manuel M. T. Chakravarty wrote:
Depends where you are, I guess. In Sydney, it would be
easy. We are teaching Haskell to about 1500 first-year
students every year.
I know that there are a number of schools in Germany and the
UK who teach functional programming on a
I know that there are a number of schools in Germany and the
UK who teach functional programming on a large scale, too.
Not so sure about the rest of the planet.
Melbourne University is teaching similar numbers (perhaps slightly less;
probably more than 1000) of first-year students
Hi!!! ^^
I am a student who study a computer programing.
I want to have Haskell software to study .
However, it is very hard to get the Haskell . and I hope you give me the way to get the Heskell.
If you mail me to show the way to get the Heskell , I would appreciate your kindness.
Thank
[EMAIL PROTECTED] writes:
I am a student who study a computer programing. I want to have
Haskell software to study . However, it is very hard to get
the Haskell . and I hope you give me the way to get the Heskell.
If you mail me to show the way to get the Heskell , I would
appreciate your
I noticed that Ralf Hinze posted a CPS monad yesterday.
Would someone be kind enough to post a simple example of a function that uses
CPS.
Thanks
Tom
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
long set of code here, I think I figured out what you all were telling me.
Compose small functions then compose bigger functions from smaller
functions and so on...
The problem I am having is I have an (IO String) where I need a (String) and
it reports it as such:
ERROR C:\Documents and
27 matches
Mail list logo
