Re: When is it safe to cheat?

Fergus Henderson wrote: On 10-May-2000, Sverker Nilsson [EMAIL PROTECTED] wrote: Relevance for Haskell would be that you wouldnt be able to fork a program written in C into a protected environment (functional sandbox?) and know that its result would depend only on its input arguments

Re: When is it safe to cheat?

they did it like this... Sverker Nilsson - Michael Hobbs

Re: Making argv a constant

Simon L Peyton Jones wrote: The point is, if I *want* to have several behaviours in one run I can always use this second technique. But Haskell as it now stands prevents me from using the first, even when I *don't* want several behaviours in one run. I'd be prepared to pay the pain if I

Re: Making argv a constant

timeStarted = performOnceBeforeMain (getCurrentTime) Just like that one would do with unsafePerformIO, but with safer semantics (hopefully) and blessed by Standard Haskell. I see some serious problems: a = (performOnceBeforeMain m1,performOnceBeforeMain m2) In which order

Re: Making argv a constant

Simon Peyton Jones wrote: It was Just Too Painful to pass the flags everywhere. For example, deep in some dark corner of the transformation system there's a constant that says how big a function body can be before GHC inlines it. Threading the command-line arguments all the way to that site

Re: space leak in length[1..]

I just tested the strides program in hbc. It runs out of space in it too. :-( A natural consequence of the current implementations of Haskells?? Sverker length[1 .. n] seems to run in constant space (that is, space independent of n), as expected. However, length[1 ..] runs out of

Extensions to Hugs

Hello Haskell-users, I am planning to add some extensions to Hugs/Gofer to make it even more usable. Possibly so that it can be used for things that currently Perl and Tcl are popular for. I would like to hear from people doing or interested in similar things. Among my (still wooly) plans

Re: Haskell Compiler for DOS or Window

Dear friends! We've dealed with funtional programming since last semetre. Until now we've worked with Gofer, but Gofer is small. It isn't possible to compile and run big programms with Gofer. Is there any bigger compiler for DOS or Windows? If yes, where can I get it? Please

random reduction order?

Will a random reduction order always terminate if there is any reduction order that will terminate? I am also interested in pointers into the litterature (preferrably by FTP). /Sverker

Re: Haskell 1.3 (Bounded;fromEnum;type class synonyms)

x) instance (Bounded a, Enum a) = FromInt a where fromInt x = succ (minBound x) x --- I would be very interested and grateful for any comments on these and related subjects. (Please try to be polite about my ignorance, though, if possible...) Sverker Nilsson