- Haskell-Cafe - Haskell.org

Developing XPCOM components (Firefox extensions) in Haskell
by Pasqualino 'Titto' Assini 12 Sep '07

12 Sep '07

Hello, I wondered if anyone could advice on how to develop XPCOM components in Haskell. I am aware that HDirect supports COM and that there are some similarities with XPCOM but I do not have the time to extend/fix HDirect to support XPCOM. Would using FFI directly be simpler? What problems should I expect? Would you anticipate platform specific issues ? The components should work under both Linux and Windows and ideally Mac as well. Thanks in advance, titto

2 1

Re: Tiny documentation request
by manu 12 Sep '07

12 Sep '07

On Sep 11, 2007, at 9:58 PM, Miguel Mitrofanov wrote: > > > Well, I'm not a web designer, but I did work with few of them, and it > seems to me that you either create a table design in two hours or > spend three days trying to create a CSS one and THEN create a table > design in two hours. That's an exaggeration. It's widely accepted than tables can straightforwardly be dropped in most cases. They are intented to be used to present tabular datas, NOT for layout. (This ideas is not new, Zeldman talked about it in 2001) It does require a bit of CSS-Fu, however, as CSS support in browsers varies... But hey, you've got to occupy these HTML-CSS guys ! Emmanuel

1 0

GraphicsMagick binding for Haskell
by Tim Chevalier 12 Sep '07

12 Sep '07

As a Hackathon project, I'm thinking of trying to write a Haskell binding for the GraphicsMagick image manipulation library (http://www.graphicsmagick.org/) Has anyone done this already? If not, would anyone else besides me use it? If you think there's a better library out there that serves a similar purpose, feel free to tell me about it as well. Cheers, Tim -- Tim Chevalier * catamorphism.org * Often in error, never in doubt "Work is there when love is gone" -- Greg Brown

2 1

"Prime" monads?
by Greg Meredith 12 Sep '07

12 Sep '07

Haskellians, Is there a characterization of "prime" monads? Here the notion of factorization i'm thinking about is decomposition into adjoint situations. For example, are there monads for which there are only the Kleisli and Eilenberg-Moore decompositions into adjoint situations? Would this be a characterization of quintessentially "free" or "generative"? Best wishes, --greg -- L.G. Meredith Managing Partner Biosimilarity LLC 505 N 72nd St Seattle, WA 98103 +1 206.650.3740 http://biosimilarity.blogspot.com

1 0

Licenses and Libraries
by H. 11 Sep '07

11 Sep '07

Hello, I have some questions connected more with the licenses and libraries as the language itself: Is it possible to: - publish Haskell source code under the BSD3 license - provide an executable binary together with the code "including" (compiled e.g. with 'ghc --make') "standard" (in the ghc compiler download) libraries of the base and/or other packages - publish Haskell source code under the BSD3 license which will work with GTK2HS - provide an executable binary together with the code compiled with 'ghc -- make' - does there have to be any special flags set to do so - does there have to be included further notes about the libraries and/or there license -- Thanks in advance, H.

2 1

Tiny documentation request
by Andrew Coppin 11 Sep '07

11 Sep '07

I have the following page bookmarked: http://haskell.org/ghc/docs/latest/html/libraries/ I'd like to ask 2 things. 1. Would it be possible to make the *huge* list of package names at the top collapsable? (That way I don't have to scroll through several pages of uninteresting text to get to the bit I actually want.) 2. Could we make is so all items are collapsed initially? (Currently they're all expended initially - which makes it take rather a long time to find anything.) Just thought I'd ask...

11 19

Can somebody give any advice for beginners?
by clisper 11 Sep '07

11 Sep '07

haskell is greate but i don't know how to start. 2007-09-11 clisper

11 10

Re: [Haskell-cafe] haskell and reflection
by Reinier Lamers 11 Sep '07

11 Sep '07

Op 11-sep-2007, om 18:43 heeft Greg Meredith het volgende geschreven: > Thanks for these comments. i wouldn't judge Haskell solely on the > basis of whether it embraced reflection as an organizing > computational principle or as a toolbox for programmers. Clearly, > you can get very far without it. And, it may be that higher-order > functional gives you enough of the 'programs that build programs' > capability that 80% of the practical benefits of reflection are > covered -- without having to take on the extra level of complexity > that reflection adds to typing. i was really just seeking information. Template Haskell [1] is a system that lets you write programs that get executed at *compile time*, and that produce parts of the Haskell program to be compiled by manipulating a representation of the program as structured data. It's a form of reflection restricted to compile time, if you'd ask me. Regards, Reinier [1] http://www.haskell.org/haskellwiki/Template_Haskell

1 0

Comments and/or Criticisms
by PR Stanley 10 Sep '07

10 Sep '07

Hi Any comments and/or criticisms would be most appreciated: --count the occurrences of char in string countC :: Char -> [Char] -> Int countC x xs = sum [1 | c <- xs, c == x] --count occurrences of chars in string countCS :: [Char] -> [(Char, Int)] countCS xs = [(x, (countC x xs)) | x <- [' '..'z'], (countC x xs) > 0] Can anyone come up with a better alternative? Thanks, Paul

8 8

Custom unary operator extension?
by Peter Verswyvelen 10 Sep '07

10 Sep '07

I find it unfortunate that one can't (I guess) define custom unary operators in Haskell. Is this correct? If so, is this just because eg (* 100) declares a function that partially applies the * operator, so this syntax disallows unary operators? Could this be fixed by introducing a different syntax for partial operator application? E.g. (? * 100) instead of just (*100)? This would also fix the ambiguity between (-10) as being either the number minus 10 or the "subtract by 10' function. Cheers, Peter

7 14