We're currently in the midst of a transition when it comes to
Cygwin, and it Isn't Right Yet.
Difficulties have been
a) (minor) it's tiresome to have to install cygwin just to use ghc
b) (much worse) if GHC was built with a different version of
cygwin than you have installed, it crashes
In reply to Simon Marlow,
- introduce a new exception constructor:
ExitException ExitCode
- System.exitWith causes (ExitException code) to be
raised in the current thread.
Not entirely relevant, in fact, barely at all but what are
the odds of user
extensible
Tue, 22 May 2001 15:43:45 +0100, Simon Marlow [EMAIL PROTECTED] pisze:
- If this exception propogates to the top of the thread, then
the main thread is also sent (ExitException code). This
only happens for a standalone executable (ie. one which was
started by
Tue, 22 May 2001 17:30:39 +0100, Simon Marlow [EMAIL PROTECTED] pisze:
Well, we could do a proper job of extensible data types, which
probably isn't hard but is certainly a fair amount of work.
This would be IMHO the only right way, but I doubt that it's that
simple. For example it would be
Timothy Docker wrote:
for info, there is a gui lib on top of sdl (then portable to linux, win) at
http://www.bms-austria.com/projects/paragui/
Jerzy Karczmarczuk writes:
[Some interesting points on functional wrappings of graphics libraries]
Has anyone considered writing a haskell
Thank you.
Now, on seeing your Tree example I tried to use it by defining height
using structural recursion. But I couldn't find a valid syntax to
pattern match - or otherwise define the function - on the type CT. Is
there one? Or, maybe, are constructor classes the only way to use these
Hello,
Are any of the various Haskell implm., e.g. ghc, being
targeted for the .NET CLR? Also can anybody point in the
direction of any projects to implement the .NET CLR on anything
other than Win32 platforms, e.g. that evil Free Software Foundation
:^)?? Let's make .NET open source!
Hi,
Are any of the various Haskell implm., e.g. ghc, being
targeted for the .NET CLR?
There is a beta haskell compiler, based on ghc-4.08.1
I believe, at http://www.mondrian-script.org/
I haven't used it, so I can't comment further.
Also can anybody point in the
direction of any
D. Tweed [EMAIL PROTECTED] writes:
In my experience the C++ idiom `you only pay for what you use' (==
templates are essentially type-checked macros) and the fact most compilers
are evolved from C compilers makes working with templates a real pain in
practice.
I'm not sure what you mean by
Also can anybody point in the
direction of any projects to implement the .NET CLR on anything
other than Win32 platforms
I haven't seen any public projects like that. Would be
interesting though..
Well, there is:
http://www.southern-storm.com.au/
Also, Miguel de Icaza (of GNOME fame,
Jerzy Karczmarczuk [EMAIL PROTECTED] writes:
We know that a good part of top-down polymorphism (don't ask me what
do I mean by that...) in C++ is emulated using templates.
Always when somebody mentions templates in presence of a True Functionalist
Sectarian, the reaction is What!?
On Wed, 23 May 2001, Tyson Dowd wrote:
Well, there is:
http://www.southern-storm.com.au/
Interesting, I wish them well.
Also, Miguel de Icaza (of GNOME fame, co-founder of Ximian) has been working
on a C# compiler.
Well I see from:
http://primates.ximian.com/~miguel/cs-compiler.html
that his
Hello Everybody,
The second part of my question pertained only to have a working version of the .NET CLR
running on non-win32 platforms, e.g. Linux.It won't do any good to only having compilers
targeted for .NET CLR if this run-time system and it's libraries only run on win32. Then
darth vadar
Pertti Kellomäki [EMAIL PROTECTED] wrote,
From: Ketil Malde [EMAIL PROTECTED]
Manuel M. T. Chakravarty [EMAIL PROTECTED] writes:
You want to be able to write
f 1 2 + g 3 4
instead of
(f 1 2) + (g 3 4)
I do? Personally, I find it a bit confusing, and I still
For humans, it is quite natural to use
visual cues (like layout) to indicate semantics.
I agree, but let us not try to do that with just two (already overloaded)
symbols.
(let ((a 0)
(b 1))
(+ a b))
let { a = 0; b = 1; } in a + b
is valid Haskell and the way I use
I realize this is a topic where it would be very easy to start a flame
war, but hopefully we can avoid that.
Paul Hudak wrote:
Why not have your tool generate layout-less code? Surely that would be
easier to program, and be less error prone.
The tool in question is Happy, and the error
I have a case where I don't know how to apply laziness well.
Consider mutable containers (e.g. STArray or a database on disk).
How to iterate over them? I see the following possibilities:
* Give up laziness, provide only a conversion to the list of items.
Since the conversion is monadic, it
17 matches
Mail list logo
