- Haskell - Haskell.org

Re: Unicode
by Marcin 'Qrczak' Kowalczyk 25 May '01

25 May '01

Sat, 26 May 2001 03:17:40 +1000, Fergus Henderson <fjh(a)cs.mu.oz.au> pisze: > Is there a way to convert a Haskell String into a UTF-16 > encoded byte stream without writing to a file and then > reading the file back in? Sure: all conversions are available as memory to memory conversions for direct use. My conversion type is parametrized by input and output character types, so you can even define UTF-16 as giving [Word16]. But [Word8] must be used for handles, so I think that in practice conversions are generally between [Char] and [Word8]. -- __("< Marcin Kowalczyk * qrczak(a)knm.org.pl http://qrczak.ids.net.pl/ \__/ ^^ SYGNATURA ZASTÊPCZA QRCZAK

1 0

Re: Templates in FPL?
by cwitty＠newtonlabs.com 25 May '01

25 May '01

Ketil Malde <ketil(a)ii.uib.no> writes: > > This is close to my personal vision. That is, a language that handles both > > run-time and compile-time computations seamlessly. Thus, the compiler would > > evaluate as much as it can, and then what's left is put in the > > executable. > > I must be missing something crucial here - I thought that was exactly > what GHC did? I've certainly had it optimize toy benchmarks > completely away... Could somebody elucidate, please? I don't know what GHC does, but there are certainly reasons why you might not want to evaluate everything possible at compile time. For instance, there may be some sort of lookup table which is very large, but is fast to compute at runtime; you might not want to store the large table on disk in your executable. Carl Witty

1 0

Do you want to be on TV?
by Roger McKenssy 25 May '01

25 May '01

We are looking for new faces for TV & Movie productions. All ages and looks. All countries. If you are interested, Please email or fax us your: ---------------------------------------------- -Name: -Age: -Country: -City: -email address: ---------------------------------------------- If your email reply gives you a delivery error, please use Fax nr 1-309-276-9964 to ensure that we get your message. Please reply only if TV, movie or modeling is of an interest to you. We hope you understand that we are trying to get ONLY serious people who really want to try and like the camera. Feel free to pass this email to a friend or a family member who maybe interested. There is absolutely no payment of any form required from your side. On the oposite, all jobs we offers are well paid. You'll be contacted for an online interview as soon as we can. Best Regards, Roger McKenssy Fax nr 1-309-276-9964 ------------------------------- This email is sent to you in full compliance with all existing and proposed email legislation. Note: You are not on a mailing list, and this is a one-time email. If we don't get an answer, you'll never hear from us any more. You are removed by default. You can still reply with the word Remove in the subject. This right is yours by law. Use Fax nr 1-309-276-9964

1 0

Re: NEPLS
by Walid Taha 25 May '01

25 May '01

Dear all, If you want to be added to the NEPLS page, please send ME your email and I'll forward it to Shriram. Cheers, Walid. On Fri, 25 May 2001, Shriram Krishnamurthi wrote: |Hi Walid, | |You were never on the mailing list (for reasons that escape me). You |are now. | |Do me a favor. Send mail around to the programming languages people |at Yale asking whether they'd like to be on the list. Find someone to |collect all these names and send them to me in a single message, |line-at-a-time (usual mail alias file format). I'll take care of |including y'all. If the name's not obvious from the email address, |please also include the full name in the usual mail format: | | "Walid Taha" <taha(a)cs.yale.edu> | |Btw, the only cs.yale.edu addresses currently on the list are | | Walid Taha <taha(a)cs.yale.edu> | hudak(a)cs.yale.edu | shao-zhong(a)cs.yale.edu | carsten(a)cs.yale.edu | |League and Courtney are on through other hostnames. Maybe I'm missing |a few others. | |Thanks. | |Shriram |

1 0

RE: a cygwin binary package of ghc-5.00.x
by Simon Peyton-Jones 25 May '01

25 May '01

I'm afraid there isn't a Windows port of 5.00.1 yet. We have one working here, but we are trying to get the packaging right so that it doesn't require Cygwin etc. If you want to build it from source, you might want to wait for Reuben to put up the 4.08 download he's about to distribute. I have myself used this download to compile the head from source yesterday, so I know it works! Simon | -----Original Message----- | From: Alexander V. Voinov [mailto:avv@quasar.ipa.nw.ru] | Sent: 24 May 2001 19:12 | To: haskell(a)haskell.org | Subject: a cygwin binary package of ghc-5.00.x | | | Hi All, | | Do anybody have one? I failed to recompile it with ghc 4.08.x. | | Thank you in advance | | Alexander | | | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell |

2 1

Re: Templates in FPL?
by Ketil Malde 25 May '01

25 May '01

Juan Carlos Arevalo Baeza <jcab(a)roningames.com> writes: > At 02:35 AM 5/24/2001 +1000, Fergus Henderson wrote: >> I agree that it would be very nice if Haskell and other FPLs had some >> equivalent feature, with a nicer syntax. I think you might be able to >> do a lot of it using ordinary Haskell syntax with just some additional >> annotation that directs the compiler to evaluate part of the program at >> compile time. > This is close to my personal vision. That is, a language that handles both > run-time and compile-time computations seamlessly. Thus, the compiler would > evaluate as much as it can, and then what's left is put in the > executable. I must be missing something crucial here - I thought that was exactly what GHC did? I've certainly had it optimize toy benchmarks completely away... Could somebody elucidate, please? Of course, having annotations to hint about specialization might be a good thing. Perhaps this could be profiled and fed back to the compiler? ISTR this is common for the SPEC benchmarks (in C or Fortran, I presume) > Problem is that, ideally, the language should allow the programmer to > be explicit about things that should be done at compile-time and things that > should be done at run-time, which Haskell doesn't quite have. Why/when do you need this? I would go for -O implying optimizing away as much as possible (i.e all constant expressions), and else no optimization (for compilation speed). -kzm -- If I haven't seen further, it is by standing in the footprints of giants

2 1

RE: IO Errors
by Steinitz, Dominic J 25 May '01

25 May '01

Simon, I (stupidly) called the executable logger and then presumably invoked something on linux of the same name. Giving it a different name gave the same result as you got. I assume this is a bug in hugs and I will refer it to that mailing list. Dominic. simonmar(a)microsoft.com on 25/05/2001 13:03:00 To: Dominic Steinitz haskell cc: bcc: Subject: RE: IO Errors > In ghc, the program hangs without even creating a file. With GHC 5.00.1 here it creates the output file containing: Starting logging 1234567812345678 Finishing logging which GHC version was hanging for you? Cheers, Simon _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell ------------------------------------------------------------------------------------------------- 21st century air travel http://www.britishairways.com

1 0

combinators
by luc 25 May '01

25 May '01

beyond specific combinator tutorial, are there any generic combinator paper, or introductory ones ? thks Luc

2 2

RE: IO Errors
by Simon Marlow 25 May '01

25 May '01

> In ghc, the program hangs without even creating a file. With GHC 5.00.1 here it creates the output file containing: Starting logging 1234567812345678 Finishing logging which GHC version was hanging for you? Cheers, Simon

1 0

CFP: LDTA'2002
by Marjan Mernik 25 May '01

25 May '01

[apologies if you receive multiple copies of this message] ----------------------------------------------------------- 2nd Workshop on Language Descriptions, Tools and Applications LDTA'2002 Affiliated with ETAPS'2002 April 13, 2002 Grenoble, France The workshop welcomes contributions on all aspects of formal language definitions, with special emphasis on applications of these language definitions and tools developed for or with these language definitions. For call for papers and additional information please check the following URL: http://www.cwi.nl/conferences/LDTA2002 Schedule Submission of full paper December 15, 2001 Notification January 31, 2002 Final version due February 28, 2002

1 0