Thanks for a great bug report. There was indeed a bug (at least one), which
I've just fixed in the CVS sources. The read buffer was being accidentally
flushed as a write buffer by the hClose. I'm still not quite sure why this
caused the file to grow, however.
Workaround: don't use
1 2 3
Hi,
I looked at HaXml a while ago
and it seemed to offer a very Dom-like interface.
I was wondering if anyone had thought of making a Sax-like
interface based on lazy evaluation. where tokens are
processed and taken from a (potentially) infinite stream
Chris
If you like copper, you will love DRC Resources: http://www.drcresources.com
***
Hello.
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type,
like
data Fn = Sum | Pro | Pow
...
extend data Fn = Sin | Cos | Tan
where first the Fn datatype had only
Erik Poll ([EMAIL PROTECTED]) did some nice theoretical work on
this a couple of years ago. I took a quick look on his web site
but couldn't see anything on it there. Maybe he can help?
Simon
Perhaps the subtyping of O'Haskell is interesting:
http://www.cs.chalmers.se/~nordland/ohaskell/
/Peter Ljunglöf
On Mon, 25 Sep 2000, Jose Romildo Malaquias wrote:
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to
On Mon, 25 Sep 2000, Jose Romildo Malaquias wrote:
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type?
I think this is what the TREX (extensible records) in Hugs are about. Take
a look at
On Mon, Sep 25, 2000 at 11:37:24AM +0100, Chris Angus wrote:
I've not seen this before,
out of interest, why would you want/need such a thing?
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously
On Mon, Sep 25, 2000 at 01:01:25PM +0200, Axel Simon wrote:
On Mon, 25 Sep 2000, Jose Romildo Malaquias wrote:
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type?
I think this is what
Hi,
Jose I am working on an Computer Algebra system to transform
Jose mathematic expressions, possibly simplifing them. There is a
Jose data type to represent the expressions:
Jose data Expr = Int Integer | Cte String | Var String | App Fn [Expr]
Jose An expression may be
There is an interesting paper which includes a method of
performing this extension in Gofer:
"Monad Transformers and Monad Interpreters"
by Liang, Hudak and Jones
I think this should be available from Mark Jones' web site at OGI.
Rob MacAulay
Is there any Haskell implementation that
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type?
I think this is what TREX (extensible records) in Hugs are about. Take
a look at
Just wondering if you'd seen the dynamic
datatype which basically gives you an "Any"
in ghc/hugs
-Original Message-
From: Jose Romildo Malaquias [mailto:[EMAIL PROTECTED]]
Sent: 25 September 2000 12:14
To: Chris Angus
Cc: [EMAIL PROTECTED]
Subject: Re: Extensible data types?
If you use Hugs -- and possibly GHC -- you might be able to use the
"Either" constructor for subtyping. I first saw this pattern in
"Modular Monadic Interpreters" (or something like that) by Jones,
Liang and Hudak. [Apologies if I didn't get the attribution right.]
data Expr a = Int
At 07:46 25-9-00 -0300, Prof. José Romildo Malaquias wrote:
Hello.
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type,
like
data Fn = Sum | Pro | Pow
...
extend data
Presumably this means differentiation/integeration would have to be typed as
diff :: (FnExt a,FnExt b) = a - b
Chris
-Original Message-
From: Peter Achten [mailto:[EMAIL PROTECTED]]
Sent: 25 September 2000 23:34
To: Jose Romildo Malaquias
Cc: [EMAIL PROTECTED]
Subject: Re:
Hello,
I am trying to process a huge bunch of large XML files in order
to extract some data. For each XML file, a small summary (6 integers)
is created which is kept until writing a HTML page displaying the
results.
The ghc-compiled program behaves as expected: It opens one XML file after
the
In the Clean Object I/O library we encountered a similar challenge and
solved it using type constructor classes. The solution can also be used in
Haskell. The basic idea is as follows:
I didn't read your message in detail, but I wonder if this is related
to the trick TclHaskell / FranTk
Jose Romildo Malaquias [EMAIL PROTECTED] writes:
Hello.
Is there any Haskell implementation that supports
extensible data types, in which new value constructors
can be added to a previously declared data type,
like
data Fn = Sum | Pro | Pow
...
extend data Fn = Sin
Chris Angus wrote:
I looked at HaXml a while ago
and it seemed to offer a very Dom-like interface.
You could say that it's DOM-like in that it deals
with trees instead of an event stream, but it's actually
somewhere in between SAX and DOM.
The main difference between HaXML and DOM is that
Myself and Lucilia ([EMAIL PROTECTED]) have modified Mark Jones'
program, "Typing Haskell in Haskell",
(http://www.cse.ogi.edu/~mpj/thih) to support system CT (paper
available at http://www.dcc.ufmg.br/~camarao/ct.ps.gz). (Thanks Mark.)
The implementation is a prototype of system CT, mainly an
Chris Angus [EMAIL PROTECTED] writes:
I was wondering if anyone had thought of making a Sax-like
interface based on lazy evaluation. where tokens are
processed and taken from a (potentially) infinite stream
Sure. While barely able to follow discussions about monadic parser
combinators,
This is a simple question about reusing a piece of Haskell code
I had an interactive program which used a function of type
prg :: String - String
prg =
{- for example -} \(c:cs) - "first char = " ++ [c]
To run that program I used
run :: IO ()
run = interact prg
Now, I want to reuse
There is no need for "." or [^abc] as Haskell list operators
can be used to "simulate" them. The following is from the C
lexer and matches all visible characters and all characters
except newline, respectively:
visible = alt [' '..'\127']
anyButNL = alt (['\0'..'\255'] \\
On 25-Sep-2000, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
I couldn't find a description of the virtual machine or its
instruction set, though I downloaded the bits. Indeed, I concluded
that it must, implicitly, be a JVM implementation, which is why they
didn't specify it. Has anyone else
I have thought of a few "functional patterns"
... there may be repeats in these as they were rattled off last night when I
was half asleep.
I must have missed some though ... anyone?
I have placed this list on the Haskell Wiki, at
http://haskell.org/wiki/wiki?CommonHaskellIdioms
Please,
hmm. Actually I wanted to write CGI scripts, interpreted by Hugs. Is
this Socket.hi only a lib for GHC? I mean is there anything simular for
Hugs? I would prefer to develop my CGI's with Hugs (for I don't have GHC
on my system) and run them as scripts.
OK, the `cheat' way to do it would
I think it would be useful if you could post the reparser stuff.
I think it would be really cool if we could parse the xml in a lazy fashion
so that the entire tree might not come into memory at once.
i.e.
let x=parse xml
in
(y,z)=processXml(someAlgebra,x)
like the circular rep-min
On Mon, Sep 25, 2000 at 05:17:15PM +0200, Jose Emilio Labra Gayo wrote:
I had an interactive program which used a function of type
prg :: String - String
prg =
{- for example -} \(c:cs) - "first char = " ++ [c]
To run that program I used
run :: IO ()
run = interact prg
Now,
Doug Ransom [EMAIL PROTECTED] wrote,
There is no need for "." or [^abc] as Haskell list operators
can be used to "simulate" them. The following is from the C
lexer and matches all visible characters and all characters
except newline, respectively:
visible = alt [' '..'\127']
31 matches
Mail list logo
