Re: [Haskell-cafe] Choosing an xml parser
Hi L, I have used TagSoup, it is fine and simple. http://community.haskell.org/~ndm/tagsoup/ 2013/7/21 L Corbijn aspergesoe...@gmail.com Hello Cafe, I am trying to write a library to parse (and process) the OpenGL xml spec into haskell values. The problem is that I don't know what xml library to choose. So far I can think of the following requirements: - Some error reporting, possibly warning for unparsed elements (as that signals that the parser needs updating). - Not too bulky for the not so simple registry schema [1]. - Preferably some way to preprocess some nodes (this could probably be done by any xml library). - Preferably not too memory hungry (the current spec is about 2MB) Does somebody have a recommendation for a xml library to use for this? Regards, Lars [1]: https://cvs.khronos.org/svn/repos/ogl/trunk/doc/registry/public/api/registry.rnc ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Hoogle index completeness
2012/12/19 Joachim Breitner m...@joachim-breitner.de: if Michael Snoyman’s stackage will fly, I’d that would be a good candidate for a default set. +10 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] How hard is it to start a web startup using Haskell?
The question 'How hard is it to start a technical startup with Haskell?' happened a couple of times on this list. Sometimes it was in the form 'How hard is to find Haskell programmers?' or 'Are there any Haskell jobs?'. I'd like to provide one data point as an answer: http://www.reddit.com/r/haskell/comments/ngbbp/haskell_only_esigning_startup_closes_second_angel/ Hi Gracjan, here is Bryan O' Sullivan's Running a Startup on Haskell in case you haven't seen it: http://www.infoq.com/presentations/Running-a-Startup-on-Haskell ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
Yea, it's cute. I don't like the formula, though: \x - x + x is just too trivial and not very Haskellish. Something higher order is the minimum requirement, IMO. The original (lambda knights) formula was cool: the fixed point operator is directly related to recursion, which is reflected in the picture that contains itself; note also that defining this operator requires an untyped language, so this fits LISP quite well (but not Haskell). I would go with something like ! forall A B. A - B, saying that type casting under the C-H isomorphism is a lie and therefore we all must avoid it :D, but I don't like the ! in front of it. Just my 2 cents. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
