- Hugs-Users - Haskell.org

downloading problems solution (?)
by Laudien, Joachim 19 Aug '02

19 Aug '02

Hi, I remember downloading problems with Netscape. In most cases the problem was that Netscape replaced Unix line ends (0A) with DOS line ends (0D 0A) - even in binary files, not only .msi, but also .tgz and others. Replacing all 0D 0A by 0A with a hex editor (e.g. http://www.chmaas.handshake.de/delphi/freeware/xvi32/xvi32.htm) solves the problem. I didn't encounter a file containing a "real" 0D 0A yet :-) Kind regards Joachim Wolf Laudien

1 0

Your message to Hugs-Bugs awaits moderator approval
by hugs-bugs-admin＠haskell.org 16 Aug '02

16 Aug '02

Your mail to 'Hugs-Bugs' with the subject Happy Assumption Is being held until the list moderator can review it for approval. The reason it is being held: Message body is too big: 141584 bytes but there's a limit of 40 KB Either the message will get posted to the list, or you will receive notification of the moderator's decision.

1 0

Winhugs question ...
by Peter Wentworth 05 Aug '02

05 Aug '02

Hi, I'm not sure who maintains WinHugs, but I have a specific feature request: namely that the fonts in the window be selectable. I occasionally like to demo something in the classroom. Being able to set font sizes larger is most useful. The workaround, (using the magnifier toos for visually impaired) is very awkward. So it suggests that settable fonts would also help anyone who might be visually impaired. peter

2 1

I think...
by Pedro L. P. Dias 26 Jul '02

26 Jul '02

... that the problem is: - if I must write my own definitions, like: inc :: Integer -> Integer inc n = n+1 in a file, and this file is a ".hs" file, so how can I write an ".hs" file? - my Hug's prompt, when I start it, is "Prelude>". If Prelude is an ".hs" file, and if that definitions were writed in "Incr.hs" file, my prompt must be "Incr>"? Thank you very much! But the manuals files I downloaded don't explain it... Best regards, Pedro. ----- Original Message ----- From: Pedro L. P. Dias <pedrolpd(a)uol.com.br> To: Hans Aberg <haberg(a)matematik.su.se> Sent: Thursday, July 25, 2002 8:08 PM Subject: Re: Problems... > Dear Professor Hans Aberg: > > Thank you for your answer! > 'Sorry to bother you again... > I found a Hugs manual, "The Hugs 98 User Manual", and it describes "module". > So, I wrote: > > module Fact where fact :: Integer -> Integer fact n = product [1..n] > > because this is the example showed at page 8 of that manual. But, > unfortunately, another error message appears: "cannot find module 'Fact' ". > I understood, from your e-mail and the manual, that I must create an ".hs" > file with my own definitions; so, how can I do this? > > Thank you very much (again!). > Best regards, > Pedro. > > ----- Original Message ----- > From: Hans Aberg <haberg(a)matematik.su.se> > To: Pedro L. P. Dias <pedrolpd(a)uol.com.br> > Cc: <hugs-bugs(a)haskell.org> > Sent: Thursday, July 25, 2002 1:36 PM > Subject: Re: Problems... > > > > At 10:31 -0300 2002/07/25, Pedro L. P. Dias wrote: > > I start Hugs, and, at the line command "prelude>", when I digit, for > > example, "add x y = x + y", an error message appear: "...unexpected > '='". > > Also, when I digit (other example) "inc n = n + 1", the error message is > > "undefined variable inc", > > > > Dig-it, Hugs is hooked up so that definitions must be in a file. So put > the > > stuff in a file and then load that file. > > > > Hans Aberg > > > > >

1 0

Re: Problems...
by Pedro L. P. Dias 26 Jul '02

26 Jul '02

Dear Professor Hans Aberg: Thank you for your answer! 'Sorry to bother you again... I found a Hugs manual, "The Hugs 98 User Manual", and it describes "module". So, I wrote: module Fact where fact :: Integer -> Integer fact n = product [1..n] because this is the example showed at page 8 of that manual. But, unfortunately, another error message appears: "cannot find module 'Fact' ". I understood, from your e-mail and the manual, that I must create an ".hs" file with my own definitions; so, how can I do this? Thank you very much (again!). Best regards, Pedro. ----- Original Message ----- From: Hans Aberg <haberg(a)matematik.su.se> To: Pedro L. P. Dias <pedrolpd(a)uol.com.br> Cc: <hugs-bugs(a)haskell.org> Sent: Thursday, July 25, 2002 1:36 PM Subject: Re: Problems... > At 10:31 -0300 2002/07/25, Pedro L. P. Dias wrote: > I start Hugs, and, at the line command "prelude>", when I digit, for > example, "add x y = x + y", an error message appear: "...unexpected '='". > Also, when I digit (other example) "inc n = n + 1", the error message is > "undefined variable inc", > > Dig-it, Hugs is hooked up so that definitions must be in a file. So put the > stuff in a file and then load that file. > > Hans Aberg > >

1 0

Crazy Lockup Issue
by Irfon-Kim Ahmad 25 Jul '02

25 Jul '02

I want to write a simple hugs program to help me parse some data. I've got one declaration so far, which just sets up the data set. However, if I try to just load this into Hugs, it gets as far as "compiling" and then locks up my computer solid. I have to power it off and on. I'm using the December 2001 Hugs binaries for MacOS9, from the website. My only element in the parameters file is, "-h 2500000". I increased this from the default, "-h 500000" in an attempt to address this problem, although the amount of data is very small, but it locks up with either setting. Huge is currently allocated 32MB of RAM in finder, also increased from the default quite a bit, and it locks up either way. Any ideas? The definition is as follows (sorry for the length, but it's just one 'line' and it's the one that seems to be causing the problem. (Also, sorry about the formatting, the lines are over 80char, so it may look a little messy on your end.) myset = [1,0,0,1,1,1,1,1,0,0,0,0,1,1,0,1,1,0,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,0,1,1,1,0 ,0,0,1,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1,0,0,1] ++ [1,1,1,1,0,0,0,0,1,0,0,0,0,1,1,0,0,1,1,1,0,0,1,1,0,0,0,1,0,1,0,0,0,0,1,0,0,1 ,1,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,1,0,0,0,0,0] ++ [1,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,1,1,0,1,0,1,1,1,1,1 ,0,1,1,0,0,1,1,0,0,1,0,1,0,0,0,1,1,1,1,1,1,0] ++ [0,0,1,0,1,1,1,1,0,0,0,0,0,0,1,1,0,1,1,1,1,1,1,0,0,0,1,0,1,1,0,1,1,0,0,1,0,1 ,1,1,1,1,0,1,0,1,0,1,1,0,0,1,0,1,1,1,0,1,1,1] ++ [1,0,0,0,1,1,1,1,1,0,0,0,1,0,1,1,1,0,0,1,0,1,1,1,0,1,1,1,0,1,0,1,0,0,0,0,1,0 ,1,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0] ++ [1,0,0,1,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,0,1,1,1,0,0,1,0,1,1,0,0,1,0,0,1,0,0,1 ,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,1,1] ++ [1,0,0,0,0,1,1,1,1,0,0,0,1,0,0,0,0,0,0,1,0,0,1,0,1,1,1,0,0,1,0,1,1,1,1,1,0,1 ,1,0,0,0,1,0,1,1,0,1,1,0,0,0,1,0,0,0,1,1,1,1] ++ [0,0,0,0,1,0,1,0,1,0,0,0,0,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,1,1,0,0,1,0,1,0,0,0 ,1,0,1,0,1,1,0,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0] ++ [0,0,0,1,0,1,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,1 ,0,0,0,1,0,0,0,0,0,0,1,1,1,1,1,1,0,1,1,0,1,1] ++ [0,0,0,1,1,1,0,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,1,0,0,1,0,0,1,0,1,0,1,1,0,0,0,1 ,1,0,0,0,1,1,1,1,1,0,0,1,0,1,1,0,0,0,0,0,0,1] ++ [1,0,0,0,0,1,0,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,1,0,1,0,0,0,0,1,1,0,0,1,0,1,1,1 ,0,0,1,0,0,0,1,1,0,1,1,1,0,1,1,0,0,1,1,1,0,0] ++ [0,1,1,1,1,0,1,1,0,1,0,0,0,0,1,1,0,1,0,1,1,0,1,1,1,0,0,0,1,1,0,1,1,0,1,1,1,1 ,0,0,1,0,0,0,0,0,0,0,1,1,1,0,0,1,0,1,0,1,0,1] ++ [0,1,1,1,0,1,0,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0,1 ,0,1,0,1,1,1,1,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1] ++ [0,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,0 ,1,0,1,1,0,1,1,0,1,0,1,1,1,1,1,1,1,0,0,0,1,0] ++ [0,0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,0,1,0,0,0,0,1,1 ,1,0,1,0,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,1,1] ++ [0,1,0,0,1,1,0,1,1,1,1,0,1,1,1,1,0,1,0,1,0,0,0,1,0,0,1,1,1,1,1,1,0,0,0,1,1,0 ,0,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,1,1,1,1,0,0] ++ [0,1,1,0,0,0,0,0,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,1,1,1,0,1,1,1,0,1,1,0 ,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,1] ++ [0,0,0,1,1,1,1,0,1,0,1,0,0,0,1,1,0,1,0,0,0,1,0,1,1,1,0,1,1,0,1,0,1,0,0,0,1,0 ,1,0,0,0,0,1,0,1,0,0,1,0,0,1,0,0,0,1,0,1,0,1] ++ [1,1,0,0,1,0,0,1,0,1,1,0,1,0,1,1,0,0,1,0,1,1,1,1,1,0,1,0,0,1,1,0,1,0,1,0,1,1 ,1,1,0,1,0,1,0,1,1,1,1,1,1,0,1,1,0,1,1,0,1,0] ++ [1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,1,0,1,1,1,0,1,0,1,1,1,1,1,0,1,1,1,1,0,0,1,1,0 ,1,1,1,0,1,0,1,1,1,0,1,0,0,0,0,1,1,0,1,1,1,1] ++ [1,1,1,1,1,0,1,1,0,0,1,1,0,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,0,1,0 ,1,0,0,0,0,1,0,0,1,1,1,1,1,1,0,0,0,0,1,1,0,1] ++ [0,1,0,0,0,0,1,0,1,1,1,0,1,0,0,0,0,1,1,1,0,0,1,1,1,0,0,0,1,0,1,1,1,1,0,0,1,0 ,0,0,1,1,0,0,1,1,0,0,0,0,1,1,1,0,1,1,1,1,0,1] ++ [0,1,1,1,0,0,1,0,0,0,1,0,1,1,1,1,0,1,0,1,0,1,1,1,0,0,1,1,0,1,0,0,1,0,0,0,1,1 ,1,1,1,0,0,0,1,0,0,0,1,1,0,0,0,1,1,1,1,1,0,0] ++ [1,1,1,0,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0,0 ,0,0,1,1,1,0,1,0,0,0,1,0,0,1,1,0,1,0,1,1,0,1] ++ [1,0,0,0,1,0,1,0,0,1,1,0,0,1,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,0,0,1,1,0,0,0 ,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,0,1,1,0] ++ [1,1,0,1,1,1,0,0,0,1,0,0,0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,0,0,0,0,0,1,0,1,1,0,0 ,0,0,1,0,1,0,0,0,0,1,1,0,0,1,1,1,0,1,1,0,1,0] ++ [1,0,1,0,1,1,1,0,1,0,0,0,1,1,0,1,1,0,1,1,1,1,1,0,0,1,1,0,0,1,0,0,1,0,0,0,0,0 ,0,1,1,1,1,1,0,1,0,0,1,0,0,1,1,1,1,1,0,0,1,1] ++ [1,1,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1,1,0,0,1,1,0,1,0,1 ,0,1,0,1,1,0,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,1] ++ [0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,1,1,0,1,0,0,0,1,0,1,1,1,1,1,0,1,1,0,0,1,0,1,0 ,1,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,0,0,1,0,0,0] ++ [1,0,0,0,1,0,1,0,0,1,0,1,1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,1,0,1,1,0,1,1,1,0,0,1 ,1,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,1,1,1,1,1,1] ++ [1,1,0,1,1,1,0,0,0,1,1,1,0,1,1,0,1,0,1,1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,1,1,1 ,0,1,0,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,0,1,0,0] ++ [0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,0,0,1,0,1,0,1,1,1,0,0,0,0,1,0,0,1,0,1,0,1,0,1 ,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1,1,0,1,0,1,1,1] ++ [1,1,1,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,0,1,1,1,1,0,0,1,0,0,1,1,0,0,1,1,0,0 ,0,0,0,0,0,1,1,1,0,0,0,0,0,0,1,0,1,0,0,0,1,1] ++ [0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0,0,0,1,1,1,0,1,1,1,1,1,0 ,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,0,1,0,0,1,0] ++ [0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,1,1,0,1,0,1,0,0,0,1,0,0,0,1,0,0 ,1,1,1,1,1,0,1,1,1,1,1,0,1,1,0,1,1,1,0,1,1,0] ++ [1,1,1,0,1,0,0,1,0,0,1,1,0,0,1,0,1,1,1,1,1,1,1,0,0,1,1,1,0,1,0,0,1,1,0,0,0,0 ,1,1,0,0,0,0,1,1,1,1,0,1,0,1,1,1,0,1,1,1,1,1] ++ [1,0,0,0,0,1,0,0,1,0,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1,1,1,0,1,1,1,0,0,1,0,0,1 ,1,0,0,0,0,0,1,0,0,0,1,1,1,0,1,1,0,1,0,0,1,0] ++ [0,0,0,0,1,1,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,1,0,0,0,1,1,0,1,0,0,1,1,1,1,0,0,1 ,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,1,0,0,1,0,1] ++ [0,0,1,0,0,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,0,0,1,0,1,0,0,0,1 ,1,1,1,0,1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0,0,0] ++ [1,0,0,1,0,0,0,1,1,0,1,0,1,0,1,1,1,0,0,1,0,1,1,0,1,1,1,1,1,1,1,0,0,1,1,1,1,1 ,1,0,1,0,0,1,1,1,0,1,0,1,0,0,1,1,1,0,1,1,1,0] ++ [1,0,1,1,1,1,0,0,0,0,1,0,0,0,1,0,1,1,1,0,0,0,1,1,0,1,0,1,1,0,0,0,1,1,1,0,1,1 ,1,1,1,0,1,0,1,1,1,0,0,1,0,0,1,1,0,1,0,0,0,1] ++ [0,0,1,1,1,0,1,1,1,1,1,1,0,1,1,0,1,0,0,0,1,1,0,1,0,1,0,0,1,0,0,1,0,0,1,0,1,1 ,1,1,0,0,0,0,1,0,1,1,1,0,1,0,0,1,1,1,1,0,1,1] ++ [0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,1,1,0 ,1,0,0,0,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,0,1,1] ++ [0,1,0,0,1,0,1,1,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0,0,0,0 ,0,1,0,1,0,0,1,1,1,0,0,0,0,0,1,1,1,0,0,1,1,1] ++ [0,1,1,0,0,1,0,1,1,0,1,1,1,0,0,0,0,1,0,0,0,1,1,1,1,1,0,1,0,1,1,0,0,1,0,1,1,0 ,0,0,0,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,1,0,0,1] ++ [0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,1,1,1,1,0,1,1,0,1,1,0,0,1,0,1,0,0,0,1,1,1,1 ,0,1,0,1,0,1,0,1,0,1,1,1,0,1,1,0,1,0,1,0,1,1] ++ [0,0,0,1,1,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,1,1,1,1,0,0 ,0,1,0,0,0,0,1,1,1,0,0,1,1,1,1,0,0,1,1,0,1,0] ++ [1,0,1,0,0,1,1,0,0,0,1,0,1,0,1,1,0,1,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,1,1,0 ,1,0,0,0,0,0,1,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0] ++ [0,1,0,0,0,0,1,1,0,1,1,1,0,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1,0,0,1,0,0,1,1,1,1,1 ,0,1,1,0,1,1,0,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0] ++ [1,1,0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,1,1,0,0,1,1,0,0,0,1,0,1,0,0,1,0,1,1,1,0,1 ,1,1,1,1,1,0,0,1,1,0,1,0,1,1,0,1,1,0,1,1,1,1] ++ [0,0,0,1,1,1,1,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,1,1,1,0,0,1,0,0,0,0,1,1,1,0,1 ,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,0,1,1,1,0,1] ++ [0,0,0,1,1,1,0,1,1,1,0,0,0,1,0,1,1,0,1,0,1,1,0,0,0,0,0,0,1,0,1,1,1,1,0,0,1,1 ,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,1,1,0,1,0,0,0] ++ [1,1,0,0,0,1,0,0,1,1,0,1,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,0,0,0,0,1 ,1,1,1,1,0,1,1,1,1,1,1,1,0,1,0,1,0,0,1,0,0,0] ++ [1,0,1,0,0,0,0,0,0,1,1,1,1,1,1,0,0,1,0,0,1,1,0,0,1,0,0,1,1,0,1,0,0,0,1,1,0,0 ,1,0,1,1,1,0,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,1] ++ [0,1,0,0,0,0,1,0,1,1,1,0,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,0,0,1,1,1,1,0,1,0 ,0,1,1,0,1,0,1,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0] ++ [1,0,1,1,1,0,0,0,1,1,1,1,1,0,0,0,1,1,0,1,1,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,1 ,0,1,0,0,1,1,1,0,1,0,1,0,1,1,0,1,1,1,1,1,0,1] ++ [0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,0,0,0,0,1,0 ,0,1,0,0,1,0,0,1,1,0,1,0,0,0,0,1,0,0,1,1,0,0] ++ [1,0,0,0,0,0,0,1,0,1,1,1,1,1,1,1,0,0,1,1,1,0,0,1,0,1,0,0,0,1,0,0,0,0,1,1,1,0 ,0,1,1,0,0,1,0,1,1,1,1,0,1,1,0,1,0,1,1,1,1,1]

2 1

hugs error message
by Luba Pozlevich 25 Jul '02

25 Jul '02

Hello, can you please give me an advice what to do - I have a hugs error message ERROR: Garbage collection fails to reclaim sufficient space What should I do better in this case - to change my program or to set other heap size? -- Luba Pozlevich, e-mail: luba(a)blackcat.pereslavl.ru

2 1

Your message to Hugs-Bugs awaits moderator approval
by hugs-bugs-admin＠haskell.org 19 Jul '02

19 Jul '02

Your mail to 'Hugs-Bugs' with the subject A special excite game Is being held until the list moderator can review it for approval. The reason it is being held: Message body is too big: 192235 bytes but there's a limit of 40 KB Either the message will get posted to the list, or you will receive notification of the moderator's decision.

1 0

Re: Hugs for MacOS X
by Johan Nordlander 14 Jul '02

14 Jul '02

> At The University of Western Australia, we use Hugs 98 on Macintoshes > to teach Foundations of Computer Science to approximately 300 > first-year students > (http://undergraduate.cs.uwa.edu.au/courses/230.123) Currently we > use Hugs 98 on MacOS 8.6. We're likely to change to MacOS X for 2003, > and we're likely to continue using Hugs 98 on that platform. > > We are considering applying to the Apple University Development Fund > for support to build an integrated development environment for MacOS > X based on the (already-ported) Hugs engine. We're not thinking of a > huge project: probably initially we will build something roughly like > the MacGofer environment (those were the days!), with an integrated > editor, command-line editing, colour-coded syntax a la the > Haskell-mode in emacs, etc. With the size (and general naivety) of > the class, the initial emphasis will be on reliability. > > My questions are: > > 1. Would this be of interest to other groups who use Hugs on Macintoshes? > (Statements of interest may increase our chances of success with AUDF.) I think this would be of interest to a large portion of the Mac users. The download figures for Hugs-Dec2001 show that a majority of Hugs users on the Mac has switched to MacOS X already. > 2. Is anyone working on this sort of environment already? To my knowledge - no. > 3. Does anyone know any reason that this sort of endeavour might be > harder than we expect? Nope, especially not if the application is set up to launch the standard Hugs distribution as a subprocess. I really hope you'll be able to find funding for this project! Good luck, Johan

9 9

IFL 2002 CALL FOR PARTICIPATION
by Ricardo Pe~na 09 Jul '02

09 Jul '02

IFL 2002 Call for Participation =============================== (Apologies for multiple postings) NEW: Registration to workshop is now open !! NEW: Paper submission is now open !! ============================================================ IFL 2002 14th International Workshop on the IMPLEMENTATION OF FUNCTIONAL LANGUAGES Madrid Spain September 16 - 18, 2002 ============================================================= Important dates --------------- Registration deadline: July 30th, 2002 Submission deadline : August 26th, 2002 further details : http://dalila.sip.ucm.es/ifl02 ============================================================= Scope of IFL 2002 ----------------- The aim of the workshop is to bring together researchers and users actively engaged in the implementation and application of functional programming languages to discuss results and new directions of research. The workshop is intended to provide an open forum for researchers who wish to present and discuss new ideas and concepts, work in progress, preliminary results etc. related primarily but not exclusively to the implementation of functional or function-based languages. A not necessarily exhaustive list of topics includes language concepts type checking compilation techniques (abstract) interpretation automatic program generation (abstract) machine architectures array processing concurrent/parallel programming and program execution heap management runtime profiling and performance measurements debugging and tracing verification of functional programs tools and programming techniques Contributions on applications of functional programming, e.g., in teaching, or on theoretical work in any of the above areas are also welcome. Contributions ------------- All attendees are encouraged to submit papers to be published in the draft proceedings and to give presentations at the workshop. Submitted papers must be written in English, conform to the LNCS format (available at: http://www.springer.de/comp/lncs/authors.html) and not exceed 16 pages. Papers should be submitted by August 26th as postscript or pdf files using the submission page of the workshop accessible through http://dalila.sip.ucm.es/ifl02. After the workshop, we will publish a high-quality subset of contributions in the Springer LNCS series. All speakers attending the workshop are invited to submit a paper. Papers for the LNCS proceedings will be refereed according to normal conference standards (see Program Committee at the web page) Ricardo Pe~na (IFL 2002 Organizing Committee Chairman) Departamento de Sistemas Informaticos y Programacion Facultad de Informatica Universidad Complutense de Madrid, 28040 MADRID e-mail: ricardo(a)sip.ucm.es Ph: (+ 34) 91 394 4313 FAX: (+ 34) 91 394 4602 http://dalila.sip.ucm.es/~ricardo

1 0