Re: Homework

(1:) $ iterate (s (lzw (+)) (1:)) [] where s f g x = f x (g x) lzw op xs [] = xs lzw op [] ys = ys lzw op (x:xs) (y:ys) = op x y : lzw op xs ys (No fair trying it out in Hugs first...) --Joe English [EMAIL PROTECTED] ___ Haskell-Ca

Re: haskell newbie seeking for advice

there are any others, I'd like to know about them as well...) --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: Arrow Classes

gt; a d c -> a (Either b d) c ( ?>) :: (b -> Bool) -> Choice (a b c) -> a b c (>?>) :: a b Bool-> Choice (a b c) -> a b c -- Minimal implementation: >|< or apl class (Arrow a) => ArrowApply a where app :: a (a b c,b) c class (Arrow a) => ArrowZero a where aZero :: a b c aMaybe :: a (Maybe c) c aGuard :: (b -> Bool) -> a b b class (Arrow a) => ArrowPlus a where (+++) :: a b c -> a b c -> a b c --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: Debugging haskell

ost time trying to understand the problem, relying on the typechecker to tell me when I've misunderstood something. Optimizing for clarity and figuring out the space behaviour are probably the next most time-consuming activities. --Joe English [EMAIL PROTECTED] __

Is there a name for this structure?

but f and g are functors and A and B categories. In some cases (g . f . g) is also equal to g; is there a name for this as well? I find myself running into pairs of functions with this property over and over again, and am looking for a short way to describe the property... Thanks, --Joe E

ANNOUNCE: HXML 0.2, XML parser for Haskell

YPE declarations) + Several data structures and public functions have been renamed + Space fault in comment parsing fixed Please contact Joe English <[EMAIL PROTECTED]> with any questions, comments, or bug reports. --Joe English [EMAIL

Re: Lazy Parsing

ab.com/~joe/hxml > (Note: HXML release 0.2 will be ready Real Soon Now, and there have been many incompatible changes since 0.1. The main thing left to be finished is the documentation, if you can live without that let me know and I'll put a snapshot up.) --Joe English [EM

Re: HaXml, memory usage and segmentation fault

the new parser's internal representation directly I again got a flat heap profile -- there doesn't seem to be anything wrong with the structure of the original program. The code will be ready to release Real Soon Now; I'll keep you posted. --Joe English [EMAIL PR

Re: HaXml, memory usage and segmentation fault

The code is alpha quality; there are a few missing features and a couple of things that it just gets wrong, but it's basically working. I'll package it up and put it on the Web when I get a chance. This may take a day or two... --Joe English [EMAIL PROTECTED] __

Re: HaXml, memory usage and segmentation fault

ziness properties than the HaXML one. Alas, my parser also suffers from a space leak under Hugs, so this only deferred the problem. Under ghc/ghci, though, it has modest memory requirements and runs without paging. --Joe English [EMAIL PROTECTED] _

Re: HaXml, memory usage and segmentation fault

see if that runs out of heap too. If so, there's not much you can do short of replacing the HaXml parser. --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [off-topic] LaTex for [[ ... ]]

thout the space between the two brackets. It's often done by squishing together two ordinary square brackets with a negative thin space (\!): \newcommand{\sembrack}[1]{[\![#1]\!} This looks good with Computer Modern; with other fonts YMMV. -

Re: Multithreaded stateful software

olve no matter what language you use. That's what usually happens to me. (Personally, if I had this project coming up, I'd use it as an excuse to finally learn Erlang...) --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: A sample revised prelude for numeric classes

a -> a -> Ordering (<=), (>=) :: a -> a -> Bool max, min :: a -> a -> a Perhaps it would make sense for PartialOrder to be a superclass of Lattice? --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: combinator parsers and XSLT

figure out a way to do this, the XSLT community will be very very happy :-) An XSLT implementation that doesn't require the entire input document to be loaded into memory is an open research question. --Joe English [EMAIL PROTECTED]