(MS Windows) GHC users,
I've experienced a small problem with the version of ld that ships with
GHC-6.4.1 for Windows. I used it to build a Postgres sample C program,
and the resulting executable segfaults on a certain line. The same
program works correctly when linked with the version of ld (a
Hello Neil,
Sunday, February 12, 2006, 10:31:40 PM, you wrote:
NM I'm working on a Windows Haskell GUI, a lot like WinHugs (stealing a
NM lot of the code from WinHugs), which I want to make cross-compiler
NM happy - i.e. Hugs, GHCi and Yhc at least. [See
NM
I added support for GHC's split-objs feature to the Gtk2Hs build
system and the size of a striped hello world GUI shrank from 2.7M to
250k. For reference a trivial program (main = print hello world) is
190k on my system.
This improvement will be included in the next release.
Thats good to
On Mon, 2006-02-13 at 21:13 +, Neil Mitchell wrote:
Hmm. Drag 'n drop. Yeah we'll have to look into that. I believe it is
supposed to work but we've not made those features available yet.
Mike Dodd's was giving some prodding on my behalf, for Yhe. I think in
the end he just got really
Haskell Weekly News: February 13, 2006
Greetings, and thanks for reading issue 24 of HWN, a weekly newsletter
covering developments in the Haskell community. Each Monday, new
editions are posted to [1]the Haskell mailing list and to [2]The
Haskell Sequence. [3]RSS
there is now a ticket and a wiki page for this, #92:
http://hackage.haskell.org/trac/haskell-prime/ticket/92
we haven't had much discussion yet; in particular noone
has said yes, that makes sense or no, we don't need that,
but Simon's questions have helped to clarify the initial message
a bit,
On Sun, Feb 12, 2006 at 09:32:14PM +0100, Niklas Broberg wrote:
Irrelevant to the discussion above, but I wonder whether the Monoid
constraint should really be there on MonadWriter. I could imagine lots
of interesting applications of writer monads that don't output a
monoid, an example would
jamie.edwards:
I have 3 integers, a b c that I want to pass to a function, and I want the
function to return the 3 integers sorted, from largest to smallest - any
idea how to do this?
Prelude let sort3 x y z = List.sort [x,y,z]
Prelude sort3 8 2 0
[0,2,8]
Cheers,
Don
On 2/13/06, JimpsEd [EMAIL PROTECTED] wrote:
I have 3 integers, a b c that I want to pass to a function, and I want the
function to return the 3 integers sorted, from largest to smallest - any
idea how to do this?
Well, the obvious way
import Data.List
foo a b c = (a',b',c')
where
On 2/13/06, Sebastian Sylvan [EMAIL PROTECTED] wrote:
On 2/13/06, JimpsEd [EMAIL PROTECTED] wrote:
I have 3 integers, a b c that I want to pass to a function, and I want the
function to return the 3 integers sorted, from largest to smallest - any
idea how to do this?
Well, the obvious
sebastian.sylvan:
On 2/13/06, Sebastian Sylvan [EMAIL PROTECTED] wrote:
On 2/13/06, JimpsEd [EMAIL PROTECTED] wrote:
I have 3 integers, a b c that I want to pass to a function, and I want the
function to return the 3 integers sorted, from largest to smallest - any
idea how to do
Hi,
This is valid code:
module Main where
main = do
let a = 3
return ()
Why isn't this one?
module Main where
main = do {
let a = 3;
return ();
};
Thanks for your help,
Maurício
___
Haskell-Cafe mailing
Maurício wrote:
Hi,
This is valid code:
module Main where
main = do
let a = 3
return ()
That desugars to
main = do
let a=3
in do
return ()
Why isn't this one?
module Main where
main = do {
let a = 3;
return ();
};
Maurício wrote:
Hi,
This is valid code:
module Main where
main = do
let a = 3
return ()
That desugars to
main = do
let a = 3
in do
return ()
Why isn't this one?
module Main where
main = do {
let a = 3;
return ();
};
Maurício [EMAIL PROTECTED] writes:
Why isn't this one [valid code]?
module Main where
main = do {
let a = 3;
return ();
};
My guess is that the compiler is confused about whether you mean
do let a = 3
return ()
or (your intended):
do let a = 3
S. Alexander Jacobson wrote:
Has anyone written a pure haskell xslt interpreter? If not, how
difficult would it be to do so?
(Ah, another cool project idea that fell by the wayside sigh!)
Back when I was doing more web work in Haskell, inventing a translation of XSLT
into Haskell was one of
The problem is that the semicolon after let a = 3 is consumed as part
of the let-declaration.
To make sure that the semicolon is not parsed as part of the let, you
need to indent it less than the variable a.
For example:
module Main where
main = do {
let a = 3
; return ();
};
Graham Klyne wrote:
S. Alexander Jacobson wrote:
Has anyone written a pure haskell xslt interpreter? If not, how
difficult would it be to do so?
(Ah, another cool project idea that fell by the wayside sigh!)
Back when I was doing more web work in Haskell, inventing a translation of
Hi,
I've posted a couple messages to the
Haskell Cafe in the last few months. I'm new to Haskell. But,
I've set out to implement my own vectors, matrices, complex numbers, etc.
One goal I have, is to overload operators
to work with my new types. The pursuit of this goal, has pushed me
to learn
On Feb 13, 2006, at 2:26 PM, [EMAIL PROTECTED] wrote:Hi, I've posted a couple messages to the Haskell Cafe in the last few months. I'm new to Haskell. But, I've set out to implement my own vectors, matrices, complex numbers, etc. One goal I have, is to overload operators to work with my new
On 13/02/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Hi,
I've posted a couple messages to the Haskell Cafe in the last few months.
I'm new to Haskell. But, I've set out to implement my own vectors,
matrices, complex numbers, etc.
One goal I have, is to overload operators to work with
21 matches
Mail list logo
