Records in Haskell 1.3

1995-09-13 Thread Simon Marlow
the proposal of having an explicit field selection operator (such as '.', '-', or '#') so that the namespace for field names can be kept seperate from the general function/value namespace. For the record, I still prefer '-' (pun intended :-) Cheers, Simon -- Simon Marlow

ANNOUNCE: Happy version 0.7 (alpha)

1993-10-28 Thread Simon Marlow
A N N O U N C E M E N T Happy v0.7 (alpha) The LALR(1) Parser Generator for Haskell This is the first public release of our parser generator system for Haskell, called Happy (a dyslexic acronym for 'A Yacc-like Haskell Parser

Re: ANNOUNCE: Happy version 0.7 (alpha)

1993-10-29 Thread Simon Marlow
For all those having problems compiling Happy with ghc version 0.16, the solution is to compile the module ProduceCode.lhs without optimisation. A small patch to the Makefile can be found on ftp.dcs.gla.ac.uk in the file pub/haskell/happy/happy-0.7-0.7.1.patch. Also, we didn't make it clear

Re: A new view of guards

1997-04-30 Thread Simon Marlow
for Simon's generalised guards: f x y | x@(Just 3) = e This to me is nicer than re-using - in a different setting. Ok, it means more than a one-symbol change to the grammar. Comments? Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University

Happy for Haskell 1.4

1997-07-09 Thread Simon Marlow
layout rule), and consistent error handling. * The %newline feature is removed, the same effect can be achieved using the new monad support. -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm

ANNOUNCE: The Glasgow Haskell Compiler, version 2.07

1997-09-22 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 2.07 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 2.07. Source distribution is freely available via the World-Wide Web and through anon.

ANNOUNCE: GHC version 2.06

1997-09-10 Thread Simon Marlow
t http://www.dcs.gla.ac.uk/fp/software/ghc/ghc-doc/install-guide.html -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm/ finger for PGP public key

ANNOUNCE: ghc version 2.08

1997-10-09 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 2.08 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 2.08. Source distribution is freely available via the World-Wide Web and through anon.

Re: Call for parsers

1997-11-14 Thread Simon Marlow
LFE Programmier- und Modellierungssprachen Oettingenstr. 67 mailto:[EMAIL PROTECTED]D-80538 Muenchen http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne -- -- Simon Marlow [EMAIL PROTECTED] University of Glasgow

ANNOUNCE: The Glasgow Haskell Compiler, Version 2.09

1997-11-27 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 2.09 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 2.09. Source distribution is freely available via the World-Wide Web and through anon.

ANNOUNCE: The Glasgow Haskell Compiler, Version 2.10

1997-12-22 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 2.10 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 2.10. Source and Binary distribution is freely available via the World-Wide Web and

ANNOUNCE: Happy Version 1.5

1997-12-22 Thread Simon Marlow
Happy 1.5 The LALR(1) Parser Generator for Haskell This is the nth public release of the parser generator system for Haskell, called Happy (a dyslexic acronym for 'A Yacc-like Haskell Parser generator'). What's new in Happy 1.5 (vs. Happy 0.9) *

Re: Binary files in Haskell

1998-02-22 Thread Simon Marlow
to regenerate the persistent store. This seems overly restrictive, it might be simpler to just use the Native or Binary classes. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk

ANNOUNCE: GHC Version 3.01

1998-02-20 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 3.01 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 3.01. The source distribution is freely available via the World-Wide Web and through

Re: Mixing guarded caf declaration with unguarded caf declaration

1998-05-21 Thread Simon Marlow
| otherwise = False is of course fine. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm/ finger for PGP public key

ANNOUNCE: GHC Version 3.02

1998-05-29 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 3.02 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 3.02. The source distribution is freely available via the World-Wide Web and through

Re: Standard Haskell: More lexical/syntactic issues (from Alastair Reid)

1998-06-24 Thread Simon Marlow
of the Prelude operators from n to n*100. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm/ finger for PGP public key

Re: GHC licence

1998-07-22 Thread Simon Marlow
commercial use. Don't get me wrong, I'm a free software fanatic. That's "free" as in "freedom", not as in "you must give everyone your source code" (1/2 :-) Cheers, Simon -- Simon Marlow [EMAIL PR

Re: some Standard Haskell issues

1998-08-07 Thread Simon Marlow
- parsing is easier Possible drawbacks: - with fixities and imports at the top, it might be possible to resolve infix expressions during parsing. Neither Hugs nor GHC nor nhc do this. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED

Re: some Standard Haskell issues

1998-08-08 Thread Simon Marlow
this clear. The idea is that they scope over the entire module. All other kinds of declaration in Haskell have this property, so it's consistent. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow

Re: some Standard Haskell issues

1998-08-10 Thread Simon Marlow
tr "s" else return () putStr " sitting on a wall" Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm/ finger for PGP public key

Re: Int vs Integer

1998-09-14 Thread Simon Marlow
possible. The common case of applying a dyadic operation to small Integers would then be pretty close in performance to that of Int (a couple of indirect jumps, and a test/branch for the overflow detection, to be precise). Cheers, Simon -- Simon Marlow

Re: Int vs Integer

1998-09-15 Thread Simon Marlow
the operations and applying transformations in the same way that we do for Ints currently. Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs.gla.ac.uk/~simonm/ finger for PGP public key

ANNOUNCE: GHC version 4.00

1998-10-12 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 4.00 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 4.00. The source distribution is freely available via the World-Wide Web and through

Re: Haskell 98

1998-10-24 Thread Simon Marlow
definition of the identity function? (it's the latter). Here's to cleaning up the language, and to more exciting obfuscated Haskell competitions! Cheers, Simon -- Simon Marlow [EMAIL PROTECTED] University of Glasgow http://www.dcs

Note from (deputy) maintainer

1998-11-05 Thread Simon Marlow
. This results in everyone getting several copies of the same message, and apparently the mail server at Glasgow is already croaking under the strain. So: please make sure you only reply to [EMAIL PROTECTED] in addition to any private addresses. Cheers -- Simon Marlow Microsoft Research Ltd., Cambridge

RE: hugs and ghc compatibility and features

1998-11-10 Thread Simon Marlow
sheet.html in the new-rts branch of GHC. Cheers, Simon -- Simon Marlow Microsoft Research Ltd., Cambridge, U.K.

RE: Plea for Change #2: Tools

1999-03-30 Thread Simon Marlow
Tommy Thorn says: Even when taking the simple example from my previous^2 post ghc -c Add.hs ghc -c Main.hs ghc -o Main Main.o Add.o Actually, you can do this in one: ghc Add.hs Main.hs -o Main we notice that it takes three commands, in the right order, each with a non

RE: Returned mail: haskell@CS.YALE.EDU... aliasing/forwarding l oop broken

1999-04-29 Thread Simon Marlow
I would be great to get to know which address one should use for the Haskell mailing list. Could not somebody please post info about that to that list, as there has been problems with that in the past (haskell.org not working, etc.). The official address for the haskell mailing list is

RE: lists do not respond

1999-04-28 Thread Simon Marlow
Sergey said: Sorry, i am testing which Haskell list is alive. [EMAIL PROTECTED] returns the mail. So are other *haskell.org lists. ? The mailing lists have just moved, which probably accounts for the problems. It may take a while for the changes to filter through. There's no change to

RE: Portability dreams

1999-05-28 Thread Simon Marlow
Picking up on a few of the points that Sven made: * There is no really portable way to level those language differences. IMHO, piping Haskell through cpp is a hack and has its own problems: nhc13 defines __HASKELL_98__, GHC __HASKELL98__; nhc13 defines __HASKELL__=3, ghc

RE: strict data field

1999-06-10 Thread Simon Marlow
It was said long ago that these strict fields help to somewhat increase the performance. For example, Ratio uses this (?). The next version of ghc will make further use of strictness annotations on constructors by unboxing/unpacking strict fields. eg. data T = T !Int will

RE: Another bug in the 98 Report?

1999-06-25 Thread Simon Marlow
Re: layout changes in Haskell 98 Having had a bit more time to muse over this issue and discuss it with Simon P.J., we came to the conclusion that the issue is far from concluded. The Haskell 98 layout rule still has some problems (shock! :-) This message is indended to summarise what I

Strange lexical syntax

1999-06-28 Thread Simon Marlow
I just uncovered a couple of strange cases in the Haskell lexical syntax. If you're not especially bothered about such things, don't bother to read on! Quick quiz: how many Haskell lexemes are represented by the following sequences of characters? 1) M.x 2) M.let

RE: Layout rules.

1999-07-02 Thread Simon Marlow
Try this variation on the same theme: mcompare x y = do i - x ==~ y if i then return EQ else do i - x =~ y if i then return LT else do return GT This code now has a very serious bug! The code is illegal, isn't it? The do

RE: mailing list

1999-07-22 Thread Simon Marlow
I don't think there was a solution. At least, I'm still being mailed :-( I guess the administrators aren't paying much attention to what's going on... Poor job. Sorry, I've been away for a few days. 1. To remove yourself from this mailing list, mail "[EMAIL PROTECTED]" with the line

RE: Haskell Parser in Hugs

1999-07-26 Thread Simon Marlow
[EMAIL PROTECTED] (Martin Erwig) wrote, I am wondering what is the best way (in terms of easy-to-use and easy-to-install) to use a parser for Haskell in Hugs. As far as I know the parsers by Sven Panne and Manuel Chakravarty require ghc. Our Haskell parser library works fine with Hugs:

RE: Again: Referential Equality

1999-07-27 Thread Simon Marlow
I would like to have a comparison instruction that compares the internal reference of two objects. Let's call it "req". req :: a - a - Bool By coincidence, I was just looking at GHC's documentation on stable names and pointers, and it seems relevant here.

RE: The dreaded layout rule

1999-07-29 Thread Simon Marlow
Manuel Chakravarty writes: What kind of implementation did the originators of this clause envision? If the layout rule is really implemented as a filter between the scanner and the parser, it seems extremely awkward to add a dependency on the error condition of the parser - in particular,

RE: The dreaded layout rule

1999-07-30 Thread Simon Marlow
Does anybody disagree with my interpretation of the standard? Are there any implementations that actually follow the standard here? (Maybe the standard should be changed to follow the implementations in this area.) Phew. Well spotted. Of course, none of the existing Haskell

RE: ANNOUNCEMENT: The Glasgow Haskell Compiler, version 4.04

1999-07-30 Thread Simon Marlow
Now that you're an (ahem) Microsoft employee, is there any intention of allowing ghc to use Visual C++ instead of gcc, We plan to allow this, but there'll be a price to pay: the gcc extensions that we use buy us about a factor of 2 in performance and binary sizes. or supporting the Win32

RE: The dreaded layout rule

1999-07-31 Thread Simon Marlow
Does it mean that the following expressions would be illegal? if cond then do proc1; proc2 else do proc3; proc4 (case e of Just x - x 0; Nothing - False) Unfortunately, yes. Now one can forget about {} and use layout everywhere. He would no longer be able to forget or he would have to

RE: Cpp symbols for Haskell 98

1999-08-24 Thread Simon Marlow
In brief: Define __HASKELL__=98 and __HASKELL98__ as preprocessor macros for all Haskell 98 compilers. Ok, GHC 4.04 (in the forthcoming patchlevel 1 release) will follow suit. Cheers, Simon

RE: Question

1999-08-24 Thread Simon Marlow
Out of curiosity, how big is the user community? How many downloads of the software? How many are on this list? There are ~700 people on the Haskell list, ~200 on glasgow-haskell-users and ~150 on hugs-users. About 160 people downloaded ghc-4.02 for Linux last month, I'm waiting to find

RE: Q: hugs behavior...

1999-08-26 Thread Simon Marlow
I think that the transformation is exactly fully laziness. Sometimes, it helps to improve space/time performance, but it needs to be tunned up due to the reasons including one given by Tweed. GHC does full laziness(*). As far as I know, no-one ever complained :) Simon (*) Well, actually

RE: Q: hugs behavior...

1999-08-26 Thread Simon Marlow
IIRC, GHC does the tuning, i.e. CAFs are garbage collected in a clever way (describe in SPJ's book, I think), e.g. if there is only one reference into the "middle" of a CAF left, only that part is kept alive. and not the wohle CAF. Comments from Mr. GC? :-) True, but this doesn't solve

Mailing lists down for a while, should be back up now

1999-09-26 Thread Simon Marlow
Maintainer's note: The Haskell mailing list, and all the other lists served by haskell.org, have recently moved to a new machine (the "real" haskell.org). None of the addresses have changed, and the address for admin requests is still [EMAIL PROTECTED] The lists have been down for a short

RE: Embedding a scripting language in a Haskell program

1999-10-06 Thread Simon Marlow
Herbert Schuetz writes: But of course if the great merger of GHC and Hugs provides all the needed functionality (including, e.g., the possibility to load and invoke interpreted modules from within compiled code), then such a project might be superfluous, and your idea #1 becomes the best

RE: [haskell] list reorg

1999-10-09 Thread Simon Marlow
I would like to add a vote for reorganization into two lists one of which is a proper subset of the other. I stopped reading Usenet a long time ago when the spam got too intolerable. In my experience, this sort of thing doesn't work too well in practice. People tend to cross-post, or

ANNOUNCEMENT: The Glasgow Haskell Compiler, version 4.04

1999-07-29 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 4.04 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 4.04. The source distribution and various binary distributions are freely available via

ANNOUNCE: Happy Version 1.6

1999-10-05 Thread Simon Marlow
Happy 1.6 The LALR(1) Parser Generator for Haskell This is the nth public release of our parser generator system for Haskell, called Happy (a dyslexic acronym for 'A Yacc-like Haskell Parser generator'). What's new in Happy 1.6 (vs. Happy 1.5) *

RE: Dynamic scopes in Haskell

1999-12-06 Thread Simon Marlow
Is there any references to memoization techniques? I could not find any reference to memoization facilities in the Haskell report and library report. Neither in the Clean report. After looking at GHC, Hugs98 and nhc98, I have found that GCH provides the memo function used in the example.

RE: Hugs/ghc Int{8,16,32,64} types and overflow

1999-12-21 Thread Simon Marlow
A quick question: what is the intended behaviour of the Hugs/ghc extension types Int8, Int16, Int32, and Int64 with regard to overflow? The documentation for the Word* types says that they compute modulo arithmetic, but there is no similar guarantee for the Int* types. Is it the intention

Mailing Lists

2000-01-11 Thread Simon Marlow
Folks, Please do not adjust your set :-) Due to problems with the haskell.org setup at Yale, all the mailing lists served by haskell.org (haskell, glasgow-haskell*, hugs* etc.) are down, as is http://www.haskell.org. Normal service will be resumed as soon as possible. Cheers, Simon

RE: live display of heap usage

2000-01-11 Thread Simon Marlow
i am preparing a demonstration on memory management/garbage collection, and to give the students some real life examples, i am looking for a simple patch to some Haskell runtime system so that it would display the heap *while* the program is running. like, opening an X window and mapping

Lists back again

2000-01-12 Thread Simon Marlow
Haskell.org is now back up again. Simon

RE: Haskell Clean

2000-01-25 Thread Simon Marlow
Well, I see what you mean, no way, NO means, etc. So, the program below in Hugs would not work as it should? Too bad... -- === -- ioio.hs dump f = readFile f = putStr gimmeThat = dump "ioio.hs" -- === Well, pedantically speaking

Mailing list archive

2000-01-31 Thread Simon Marlow
A few folk have asked about an archive of this mailing list recently - the answer is that the one at Glasgow isn't being updated any more (and it was never very good anyway). There's a better archive at http://www.mail-archive.com/haskell@haskell.org and similarly for all the other

RE: mail delivery

2000-02-23 Thread Simon Marlow
Sergey writes: Today, there came the letter by Joe English on space leak etc., dated of February 06. And today is February 22. I wonder, what is the matter with the mail lists. This was due to the filtering on haskell.org, which thought the message contained an admin request

RE: Wanted: mmap or other fast IO

2000-02-16 Thread Simon Marlow
Title: RE: Wanted: mmap or other fast IO Is there any interface to mmap(2) available? Something that behaves like an immutable array would be great. An mmap may have a signature like mmap :: Ix a, ?? b = Handle - IO (Array a b) I've no idea what types should be allowed for b. It

RE: Unused identifiers in default case patterns

1999-06-25 Thread Simon Marlow
Alternatively, of course, the coding style could simply change to case e of -- ... _other - default_action or case e of -- ... _ - default_action The former is IMHO ugly, and the latter fails to indicate to the reader that this is intended to match not

New Haskell mirror

2000-03-08 Thread Simon Marlow
-Original Message- From: Simon Marlow [SMTP:[EMAIL PROTECTED]] Sent: 25 February 2000 13:54 Subject:I Want A Mirror IP addr : 148.88.2.7 (no name in the DNS?) Browser : Mozilla/4.0 (compatible; MSIE 5.01; Windows NT 5.0) Referer : http://www.mirror.ac.uk

RE: Additions to the FFI API

2000-03-29 Thread Simon Marlow
GHC folks, would it be a problem to allow transparent unwrapping of newtypes in foreign calls? Shouldn't be a problem, I'll be happy to do it if that's what the conclusion is. I don't understand Qrczak's comment: data CLDouble = CLD# Double# -- ugh, plain newtype won't work if we

RE: ServiceShow for error messages

2000-03-31 Thread Simon Marlow
The problem with this is that there is a performance penalty to be paid for overloading a function in this way. `take' is implemented as a function of two arguments, as you would expect. It is given a number and a list; it has no idea what type the list has, nor does it need to: it just

RE: Type and class names

2000-05-08 Thread Simon Marlow
Why are type constructors and classes in the same namespace? Because otherwise the syntax module M ( T ) where would be ambiguous. I suppose it could be resolved to mean "export the class and/or data type T". It was proposed for Haskell 98 that the syntax be changed to

RE: Performance, and algorithms

2000-05-08 Thread Simon Marlow
* I find it difficult to understand how the code I write translates into actual algorithms, memory management, etc. Haskell is such a nice language that it hides all this detail from me :-). So, I'd be grateful for a reference or two on this area. Manuel pointed out Simon's paper on the

Haskell Web Server: please pummell

2000-05-08 Thread Simon Marlow
Dear Haskell folks, There's a web server written in Haskell running on haskell.org: http://www.haskell.org:8080/ Please surf on over and press reload a few times. First one to bring it down gets a gold star. I'll be watching the logs :-) The source (not properly packaged, just

RE: lines --- to derive, or not to derive ;-)

2000-05-10 Thread Simon Marlow
Simon Marlow wrote: | lines :: String - [String] | lines s = lines' s "" | where | lines' [] acc = [acc] | lines' ('\n':s) acc = reverse acc : lines' s "" | lines' (c:s)acc = lines' s (c:acc) | | This one is more than twice

RE: lines --- to derive, or not to derive ;-)

2000-05-10 Thread Simon Marlow
Yes, break is very expensive due to its pairing up of results for every character consumed. You didn't mention the accumulating parameter version: lines :: String - [String] lines s = lines' s "" where lines' [] acc = [acc] lines' ('\n':s) acc = reverse acc : lines' s

RE: import List(..) ?

2000-05-15 Thread Simon Marlow
the grammar for import and export lists use `tycon' and `qtycon' (respectively) rather than `gtycon'. Is there any particular reason for this, or is this just a defect in the Haskell 98 report? Would changing `qtycon' to `gtycon' in the grammar production for `export' cause any problems?

RE: Results: poll: polymorphic let bindings in do

2000-06-07 Thread Simon Marlow
Thanks for everyone who participated in the recent poll. Here are the results: Never used: 6 Sometimes used: 1 Common commments: willing to give it up for something cool can be easily rewritten wouldn't make a lot of difference not sure if used ever, but

RE: Sockets

2000-06-27 Thread Simon Marlow
How do I use sockets in Haskell? The ghc manual had some information in the users guide (6.7 Interfaces to C libraries) but the sentence which started tantalisingly "Various examples of networking Haskell code are provided in " had no second half. I'd prefer to use hugs during

ANNOUNCE: Happy version 1.8

2000-07-13 Thread Simon Marlow
ANNOUNCING Happy 1.8 - The LALR(1) Parser Generator for Haskell I'm pleased to announce version 1.8 of Happy, the parser generator system for Haskell. Changes in this version, relative to version 1.6 (the previous full

RE: Haskell libraries, support status, and range of applicability(was:Haskell jobs)

2000-07-26 Thread Simon Marlow
Simon, can you tell me how I shall link to hslibs, especially each individual library? Obviously a user would also like to download a single library. That's not so obvious to me. We're going to the effort of packaging up all these libraries into a single coherent collection, that can be

RE: Library for URLs?

2000-09-04 Thread Simon Marlow
Keith Malde writes: Apologies for not bringing up heavy theoretical issues, but is there a library routine for retrieveing URLs? I need to digest some web pages and extract a bit of data from them, and I've munged together a rather naïve XML (and soon HTML) parser[0], but I bet

RE: simple binary IO proposition.

2000-09-04 Thread Simon Marlow
"Incorrect" UTF-8 in Chars is seen only by the conversion engine and sometimes by low-level I/O code. ... and by the application if it inadvertently specifies "no encoding" when the source is actually encoded. I think I agree with John here - specifying "no encoding" on a Handle shouldn't

RE: Library for URLs?

2000-09-04 Thread Simon Marlow
Yep, the GHC stuff is a gold mine, and one which I frequent all to rarely (mostly using Hugs for development). Unfortunately, I can't find any URI - String functions - but I could probably build it on top of URI and Socket (great stuff btw, just what I (might) need) URI is an instance of

RE: Preemptive thread switching in concurrent haskell??

2000-09-22 Thread Simon Marlow
Why does this code fragment print a continous stream of b's? I thought it should print some alternation of a's and b's. I am using GHC 4.08.1 on Windows 98 with Cygwin. import Concurrent main = forkIO a b where a = putStrLn "a" a b = putStrLn "b" b ---

RE: Preemptive thread switching in concurrent haskell??

2000-09-22 Thread Simon Marlow
On Fri 22 Sep, [EMAIL PROTECTED] wrote: Why does this code fragment print a continous stream of b's? I thought it should print some alternation of a's and b's. Sorry, I don't know the answer, but this post reminds me of something I'd been meaning to ask.. I seem to remember reading

Mailing list software changing

2000-10-09 Thread Simon Marlow
Dear Haskell Haskell-cafe, At haskell.org we're migrating the mailing lists from majordomo (which is somewhat old and clunky) to Mailman, which will amongst other things make my life a lot easier, provide better archives, add digest support and allow subscription/unsubscription via a web

RE: Imperative Object Destruction

2000-11-13 Thread Simon Marlow
That's the problem. And I think your solution is overly complicated. Why not copy what Common Lisp does, just that Haskell can do it without macros: withOpenFile :: FilePath - IOMode - (Handle - IO a) - IO a withOpenFile name mode action = do handle - openFile name mode

RE: ANNOUNCE: HaXml 1.00

2000-11-17 Thread Simon Marlow
An older version of HaXml is also included in GHC's hslibs, in package "text". This will probably be updated to 1.00 at some time. great, I assume you'll check in the new version? Cheers, Simon ___ Haskell mailing list [EMAIL PROTECTED]

ANNOUNCE: Happy version 1.9

2000-12-20 Thread Simon Marlow
ANNOUNCING Happy 1.9 - The LALR(1) Parser Generator for Haskell - I'm pleased to announce version 1.9 of Happy, the parser generator system for Haskell. Changes in this version, relative to version 1.8 (the previous full

RE: {-# LINE 100 Foo.hs #-} vs. # 100 Foo.hs

2001-01-15 Thread Simon Marlow
What should be the preferred way of marking correspondence to source positions after some preprocessing? Here is what is currently supported: | {-# LINE 100 "Foo.hs #-} | # 100 "Foo.hs" +--+--

RE: An Haskell compilation server

2001-01-17 Thread Simon Marlow
How about turning ghc into a compilation server ? It would run as a daemon waiting for network connections, retrieve source files (through the same network socket, or nfs, or cvs, ...), compile them locally, and send back the result. This would prevent having to reload the compiler for

RE: Source tar ball for Simon Marlow's Haskell Web Server??

2001-02-01 Thread Simon Marlow
I looked on www.haskell.org for the Simon Marlow's Web Server, but couldn't find. Did I overlook it? The source is here: http://research.microsoft.com/~simonmar/hws.tar.gz Cheers, Simon ___ Haskell mailing list [EMAIL

RE: The Do-Let-Braces problem

2001-02-15 Thread Simon Marlow
Mark Utting writes: fb::IO () fb = do { putStr "Enter Data: "; line - getLine; let line2 = line; putStr line2; } ERROR "f.hs" (line 13): Syntax error in definition (unexpected symbol "putStr") I find it hard

RE: running for long enough...

2001-04-25 Thread Simon Marlow
About the program below, someone (I think Simon Marlow) said that if I run it for long enough, I'll see as rather than bs. I would like to know for how long I will have to wait, since 2 hours were not enough to see it switching from bs to as. main = forkIO a b where

ANNOUNCE: Happy 1.10 released

2001-04-27 Thread Simon Marlow
ANNOUNCING Happy 1.10 - The LALR(1) Parser Generator for Haskell - I'm pleased to announce version 1.10 of Happy, the parser generator system for Haskell. Changes in this version, relative to version 1.10 (the previous full

RE: Happy and Macros (was Re: ANNOUNCE: Happy 1.10 released)

2001-05-10 Thread Simon Marlow
S. Alexander Jacobson writes: I am not a parsing expert, but given the recent discussion on macros, I have to ask: why use happy rather than monadic parsing? Monadic parsing allows you to avoid a whole additional language/compilation step and work in Hugs (where you don't have a

RE: BAL paper available

2001-05-16 Thread Simon Marlow
I don't like the idea of a program working which compiles only under compilers which have certain language extensions built in. If I understand things correctly, there is a list of language extensions (FFI for example), which has been accepted by all Haskell compilers developers. If

I/O buffering (was: Endangered I/O operations)

2001-05-24 Thread Simon Marlow
[ moved from glasgow-haskell-users to [EMAIL PROTECTED] ] Carl Witty writes: If the report does not allow the implementation to flush buffers at any time, I would call that a bug in the report. Indeed, perhaps the report should be clarified on this issue. Currently, in section 11.4.2 the

RE: Building Programs Again

2001-05-28 Thread Simon Marlow
I am going to install hmake and upgrade to ghc 5 but in the meantime I decided to use make. I am puzzled however. Presumably building a module that imports a module needs the .hi file and therefore the makefile should be something like this: Tagsv1.o : Tagsv1.hs ghc -c

RE: infelicity in module imports

2001-07-04 Thread Simon Marlow
Malcolm Wallace writes: I submit that the way `hiding' clauses are ignored is a vestige from the days when it was not possible to have overlapped module renamings. Now that overlapped renamings are possible, the `hiding' clauses should be permitted to take effect. I think you're right.

RE: infelicity in module imports

2001-07-05 Thread Simon Marlow
Simon Peyton Jones writes: In short, an import *always* brings the entire *qualified* set of names into scope. Hiding and revealing applies only to unqualified names. I must say that I thought GHC implemented this rule; if not I should fix it. That's not my reading of the report, and it's

RE: Profiles in GHC

2001-07-23 Thread Simon Marlow
Can anyone give me a brief explanation (or show me where in the web I can find some info) about using the profiling library in GHC? Is it avaible for Windows 98/NT? There's documentation on GHC's profiling facilities here: http://www.haskell.org/ghc/docs/latest/set/profiling.html

RE: Haskell 98 Report possible errors, part one

2001-07-23 Thread Simon Marlow
3. A precedence table says that case (rightwards) has higher precedence than operators and right associativity. If it's meaningful to talk about precedence of such syntactic constructs as case at all, it should probably be told to have a lower precedence, so case x+1 of ... is valid as

RE: getting started with the glasgow haskell compiler

2001-08-09 Thread Simon Marlow
I'm just getting started using the glasgow haskell compiler and when I try to compile a simple program, named Hello.lhs, like this: module Main (main) where main = putStrLn Hello World end with the command ghc Hello.lhs I get the message on standard output: No definitions

RE: The future of Haskell discussion

2001-09-17 Thread Simon Marlow
Jeffrey Palmer writes: I think the question is more along the lines of Why doesn't Haskell come bundled with complete, useful and _supported_ libraries? There's an ongoing effort to rectify the situation. There is a mailing list: [EMAIL PROTECTED], which you can join by going to

RE: Prelude and (:) and []((:), []) bugs?

2001-09-20 Thread Simon Marlow
As far as I can tell, the report doesn't allow (:) or []((:), []) in the export list, yet the hugs prelude has the first and the GHC prelude has the second. Have I missed something that allows them or is this a bug in the preludes or the report? (:) is allowed in an export list; it is

  1   2   3   4   5   6   7   8   9   10   >