ANNOUNCE: HXML 0.1, an(other) XML parser for Haskell

2001-11-02 Thread Joe English
2 Nov 2001 Announcing HXML, an(other) XML parser for Haskell. This implementation should have better space behaviour than HaXml's parser, and may be used as a drop-in replacement in existing HaXml programs. HXML is available at: http://www.flightlab.com/~joe/hxml/ > The current version i

Re: Scope of imported names

2001-11-02 Thread Marcin 'Qrczak' Kowalczyk
Fri, 2 Nov 2001 09:30:37 -0800, Simon Peyton-Jones <[EMAIL PROTECTED]> pisze: > | They are also different in spirit from the rules for > | instance declarations in section 4.3.2 where the binding > | occurrences for the names of the methods must be qualified if > | the unqualified method name

Re: Haskell 98 Revised

2001-11-02 Thread Ian Lynagh
On Fri, Nov 02, 2001 at 09:30:36AM -0800, Simon Peyton-Jones wrote: > Haskellers! Hi Simon :-) > It's that time of the month. I'm putting out the November release > of the Revised Haskell 98 Report. As ever, I earnestly seek your > feedback. Especially I'd like to know whether I have stumbl

RE: Scope of imported names

2001-11-02 Thread Simon Peyton-Jones
Karl-Filip wrote (on 22 Oct): | What I'm driving at is this: I propose that top level | bindings shadow imported names and that qualified names can | not be used to refer to declarations in the same module. [His message had a lot more in it, of course, but this is the nub.] There followed a s

Haskell 98 Revised

2001-11-02 Thread Simon Peyton-Jones
Haskellers! It's that time of the month. I'm putting out the November release of the Revised Haskell 98 Report. As ever, I earnestly seek your feedback. Especially I'd like to know whether I have stumbled in rewriting the section about Enum in the light of recent email. http://resear

Re: Robustness of instance Read Char

2001-11-02 Thread Sigbjorn Finne
Simon Peyton-Jones [EMAIL PROTECTED] writes: > [.. following up to Peter Thiemann's post on the slowness of Read(S) ..] > I do agree with you that it woud be better for the Read class > to use a Maybe result rather than a list of parses. But I'm not > sure your problem can be solved simply by

Re: Type checking question

2001-11-02 Thread Rijk-Jan van Haaften
Hello, Adrian wrote: >textNew (creates a new text widget) has type: >textNew :: AdjustmentClass adj => Maybe adj -> Maybe adj -> IO Text > >But when I try to create one using: > txt <- textNew Nothing Nothing > >GHC complains: >Main.hs:82: > Ambiguous type variable(s) `a' > in

Type checking question

2001-11-02 Thread Adrian Hey
Hello, I've been playing around with GTK+HS recently. This makes extensive use of Haskell classes, so I sometimes get strange type errors like this one.. textNew (creates a new text widget) has type: textNew :: AdjustmentClass adj => Maybe adj -> Maybe adj -> IO Text But when I try to create

RE: Robustness of instance Read Char

2001-11-02 Thread Simon Peyton-Jones
I do agree with you that it woud be better for the Read class to use a Maybe result rather than a list of parses. But I'm not sure your problem can be solved simply by making the Char instance of Read better. The point is that the parser has to read the *whole* string before it can be sure that

RE: 'Forall' Polymorphism Question

2001-11-02 Thread Andrew Kennedy
Not quite. "A definition is impredicative if it refers to a collection which contains the object to be defined." (see http://www.xrefer.com/entry/552390) If you stratify a type system so that quantifiers only quantify over things at a lower "stratum" then (I think) it is predicative (= not impr

Re: Transmitting parameters

2001-11-02 Thread Wolfgang Jeltsch
On Friday, 2 November 2001 07:10 Raul Sierra Alcocer wrote: > Hi, > > What mechanism of transmiting parameters does Haskell implement? > > Thank you, > Raul Anyway, it does not make sense to distinct between call-by-value and call-by-reference in the traditional way since variables cannot be mod

Re: Transmitting parameters

2001-11-02 Thread Lennart Augustsson
> >> >What mechanism of transmiting parameters does Haskell implement? > >> > >> By value. > > > >Yes, though one might equally say that they are passed by > >reference, since in > > > > Oh, yeah, they're passed by thunk. I forgot about the laziness. Well, Haskell does not really specify which

ANNOUNCE: Generic Haskell version 0.99 (Amber)

2001-11-02 Thread Andres Loeh
Generic Haskell version 0.99 (Amber) We are happy to announce the first release of Generic Haskell, an extension of Haskell which facilitates generic programming. Generic Haskell includes the following features: * type-indexed va

Re: Transmitting parameters

2001-11-02 Thread Ashley Yakeley
At 2001-11-02 02:21, Jon Fairbairn wrote: >> >What mechanism of transmiting parameters does Haskell implement? >> >> By value. > >Yes, though one might equally say that they are passed by >reference, since in > >g = let f x = x+x >z = factorial 1000 > in f z * z > >the 'first' instan

Re: Transmitting parameters

2001-11-02 Thread Jon Fairbairn
> At 2001-11-01 22:10, raul sierra alcocer wrote: > > >What mechanism of transmiting parameters does Haskell implement? > > By value. Yes, though one might equally say that they are passed by reference, since in g = let f x = x+x z = factorial 1000 in f z * z the 'first' instance

Re: Transmitting parameters

2001-11-02 Thread Ashley Yakeley
At 2001-11-01 22:10, raul sierra alcocer wrote: >What mechanism of transmiting parameters does Haskell implement? By value. -- Ashley Yakeley, Seattle WA ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell