hi,
In relation to my other message, I can contribute to this question. I
think it is very important and useful to consider Strings as Sequences of
Characters. And independently of the issue discussed elsewhere -- whether
Characters should be a type or a class -- I am asking whether Sequences
sh
hi,
Abstract Data Types plus Data Structures gives Abstract Data Structures.
Divide by Conquer is a technique that every Computer Science Undergraduate
learns: to sort a listm sort each of its halves then merge. This is what
I call "Computational Divide and Conquer" and it is an important algori
Robert Will wrote:
Why is 'last' so much slower than 'head'? Why is 'head' not called
'first'? Why does 'but_last' (aka init) copy the list, but 'but_first'
(aka tail) does not?
Are those rhetoric questions, asked just to inspire some discussion, or
you *really* don't know why?
Jerzy Karczmarc
Jerzy Karczmarczuk wrote:
Robert Will wrote:
Why is 'last' so much slower than 'head'? Why is 'head' not called
'first'? Why does 'but_last' (aka init) copy the list, but 'but_first'
(aka tail) does not?
Are those rhetoric questions, asked just to inspire some discussion, or
you *really* do
Am Dienstag, 9. Dezember 2003 18:34 schrieb Malcolm Wallace:
> [...]
> > The most obvious is the LVM. See Helium though the LVM is not tied to it.
>
> Both Hugs and nhc98 are also based on bytecode interpreters.
Wouldn't it be good to implement an LVM import/export feature in GHC, Hugs and
nhc9
What are the options for parsing/lexing (X)HTML? As far as I can see...
- the HTML library in GHC (or from Andy Gill) is for creating documents,
not parsing them
- HaXml looks like it might do what I want, but (1) seems tricky to
install (needs "make", which isn't that cool for Windows); (2) h
It appears that the Haskell XML Toolbox may be what I want -
http://www.fh-wedel.de/~si/HXmlToolbox/ - but any other suggestions would
be appreciated. Apologoies for relying on Haskell.org rather than
Googling (I'll mail the web page maintainers).
Cheers,
Andrew
andrew cooke said:
>
> What are
> Wouldn't it be good to implement an LVM import/export feature in GHC, Hugs
> and nhc98?
To read and write lvm bytecodes?
That could be quite a lot of work because the bytecodes are specific to the
abstract machine and the abstract machines are different. Unless the LVM is
essentially just a
Thanks - you should have replied to the list, because I think I did your
package a dis-service. I've just been looking at the Haskell XML Toolbox,
and comparing the two, and now that I understand a little more it seems
like either will be fine for me.
In fact I will copy this to the list, hope t
