popen lazy args and input pipe

2002-03-21 Thread Jens Petersen
Volker Wysk <[EMAIL PROTECTED]> writes: > On 21 Mar 2002, Jens Petersen wrote: > > Volker Wysk <[EMAIL PROTECTED]> writes: > > > POpen-1.0.0 contains the same bug which I made. It doesn't ensure that > > > the values which are needed after the call of forkProcess, before that > > > of executeFile

Typo: Hugs Bug ! >> it was +

2002-03-21 Thread Ahn Ki-yung
Prelude> f 1 where f x = x : f x [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, ,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, ,1,1,{Interrupted!} Prelude> f 1 where f x = x + f x in unix/linux proper error msg comes out and back to interpreter.

stripcomments 1.0

2002-03-21 Thread Thomas Hallgren
Hi, There now is a program that strips comments and blank lines properly. You can get the Haskell source code from: http://www.cse.ogi.edu/~hallgren/stripcomments/ How hard it is to do a real job of course depends on what you start from. I happened to have a lexer for Haskell, that was re

Re: Haskell slicing tool?

2002-03-21 Thread senganb
On Wed, 20 Mar 2002 10:42:15 + "Olaf Chitil" <[EMAIL PROTECTED]> wrote: > [EMAIL PROTECTED] wrote: > > > > > Are there any tools to perform program slicing on Haskell? > > > > I often find myself wanting to find all "fromJusts" invoked > > > > from the current function, or all functions that

catch (fail "...")

2002-03-21 Thread Brian Huffman
Hi, Here is a problem I came across recently, revealing a difference between ghci and Hugs: hugs> catch (error "not ok") (\e -> putStrLn "ok") Program error: not ok ghci> catch (error "not ok") (\e -> putStrLn "ok") *** Exception: not ok hugs> catch (ioError (userError "not ok")) (\e -> putStr

Re: Bug in IO libraries when sending data through a pipe?

2002-03-21 Thread Volker Wysk
Hi On 21 Mar 2002, Jens Petersen wrote: > Volker Wysk <[EMAIL PROTECTED]> writes: > > POpen-1.0.0 contains the same bug which I made. It doesn't ensure that > > the values which are needed after the call of forkProcess, before that > > of executeFile, are fully evaluated. So, if they are read laz

ICALP2002: accepted papers and preliminary program

2002-03-21 Thread icalp2002
Dear Sir/Madam, I'm sending you the following information: -the list of accepted papers for ICALP'2002 (an HTML table with two columns; authors and title) -the preliminary program of ICALP'2002 is available on http://sirius.lcc.uma.es/ICALP2002/PreliminarySchedule.html (and on the "news" of

Re: Lambda over types.

2002-03-21 Thread anatoli
Hal Daume III <[EMAIL PROTECTED]> wrote: > I'd be interested in seeing how you do this. I attempted such a thing a > while back but was unsuccessful. Attached are two interpreters: one for untyped lambda calculus, and one for an Unlambda-style language (combinators). Of course pure lambda terms

Re: Bug in IO libraries when sending data through a pipe?

2002-03-21 Thread Jens Petersen
Hi Volker, Volker Wysk <[EMAIL PROTECTED]> writes: > On Mit, 2002-03-20 at 07:00, Jens Petersen wrote: > > Jens Petersen <[EMAIL PROTECTED]> writes: > > > > > > The problem is that the child process doesn't > > > > receive all the data which the parent sends. It's as > > > > if "hPutStr vonh tx

Re: Hugs Bug !

2002-03-21 Thread Rijk J. C. van Haaften
>but in windows 2000 > >Then suddnly interpreter fails and >the red (X) popup window pops up. > >hugs.exe - application programm error > > unknown software exception (0xc000fd) ... blabla Are you sure you have the very very very latest download? There have been some undocumented updates of t

Re: Haskell puzzles!

2002-03-21 Thread Rijk J. C. van Haaften
Zdenek Dvorak wrote: >>- >>1) Are e1 and e2 equal? >> >> > f (x:xs) y = x >> > g (x:xs)= \y -> x >> > >> > e1 = seq (f []) 1 >> > e2 = seq (g []) 1 > >Should not these be > >f (x:xs) y = y >g (x:xs)= \y -> y >? >Otherwise, both e1 and e

Re: using less stack

2002-03-21 Thread Graham Hutton
> In the case of foldr the end of the list has to be > reached before anything can be evaluated. This is perhaps a good time to point out the common missconception that foldr can only be used to define functions that process the elements of lists in right-to-left order. For a discussion of this

[E-CFP] WFLP2002 - deadline EXTENSION

2002-03-21 Thread WFLP2002 Organizing Committee
Title: [E-CFP] WFLP2002 - deadline EXTENSION Dear Colleague The submission deadline for the WFLP 2002 has been extended till   March 27, 2002 WFLP 2002 is the 11th international workshop on functional and (constraint) logic programming.  WFLP 2002 aims to bring together researchers interes

Re: question about concurrency implementation

2002-03-21 Thread Phil Trinder
Dean, Alastair Reid wrote: > > Just to be sure we agree on terminology: some people like to > > distinguish between "parallelism" and "concurrency". > > > > Parallelism is a way of going faster but doesn't change your > > programming model. Implemented correctly, a parallel implementation > >

Re: using less stack

2002-03-21 Thread John Hughes
\begin{rant} I think the whole seq thing is very confusing for beginning/intermediate haskell programmers. I was very confused for a long time as to why > (unsafePerformIO (putStrLn "Hello")) `seq` 5 would print "Hello", but > [unsafePerformIO

Hugs Bug !

2002-03-21 Thread Ahn Ki-yung
Prelude> f 1 where f x = x : f x [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, ,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, ,1,1,{Interrupted!} Prelude> f 1 where f x = x : f x in unix/linux proper error msg comes out and back to interpreter.