Re: [Haskell-cafe] HXT namespace problem

runX $ constA (request TableListRequest) >>> root [] [writeA] >>> writeDocument [(a_indent,v_1)] "-" writeDocument [(a_indent,v_1), (a_check_namespaces, v_1)] "-" should do the trick. Cheers, Tim ___ Haskell-Cafe mailing list Haskell-Cafe@ha

Re: [Haskell-cafe] flip dot

Thoughts? Without considering the subtleties of the different meanings of "." in Haskell, I fail to see what people find so exciting about left to right function composition. I find "not . null" much easier to read than "null >>> not", let alone ".null.not". IMO, the following are good reas

Re: [Haskell-cafe] Re: Numeric type classes

Bryan Burgers schrieb: [...] it would probably be a little bit of a pain to have to define instances of each data declaration (Integer, Int, Float, Matrix, Complex, etc.) on each of these seperate classes--especially when being in a certain class usually implies being in another [...] Somethi

Re: [Haskell-cafe] Haskell wiki: most popular pages

Bulat Ziganshin wrote: i think that definitions with omitted arguments can be more hrd to understand to newbie haskellers, especiallyones who not yet know the language. as Tamas suggests, this page can be used to present to such newbies taste of Haskell so listing all the parameters may allow to

Re: [Haskell-cafe] Haskell wiki: most popular pages

Oh my lord, I love how my newreader obfuscates my posts. = span p' xs where p' x = not (p x) = span

Re: [Haskell-cafe] Haskell wiki: most popular pages

[...] it's just a pleasure to see all those one-line definitions and feel how power the language should be to allow such cool things. It is indeed. I find these explicit definitions often much more instructive than purely implicit definitions. But, call me a nitpicker, some of the definit

Re: [Haskell-cafe] Can someone explain this typing restriction?

It can be found here: Thanks! Actually I've seen this page before, but was too retarded to figure that you can access the actual document there. I thought it was just an abstract... (*embarrassed*) ___ Ha

Re: [Haskell-cafe] Can someone explain this typing restriction?

I had a feeling this was discussed in "Typing Haskell in Haskell" by Mark Jones, but after a quick skim I can't find it again (I thought it would be in Section 11.6 of his paper). It is, on page 35 (section 11.6.3) of "Typing Haskell in Haskell" by Mark Jones. Now you got me hooked. Whe

Re: [Haskell-cafe] Can someone explain this typing restriction?

> [...] Basically I interpret a symbol in a syntax-tree which can belong to different type-classes. [...] I meant, to different types of the same type-class. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

[Haskell-cafe] Can someone explain this typing restriction?

I've stumbled over the following (code *extremely* simplified): f :: Bool f = g 1 g :: Num a => a -> Bool g _ = f This results in the following error message (on GHC): Contexts differ in length When matching the contexts of the signatures for f :: Bool g :: forall a. (Num a) =>

Re: [Haskell-cafe] Is there a notion for identity?

Thanks for all infos. I'll apply that Ref-datatype from the "observable sharing" paper to my problem and see where this brings me. I'm also looking into the solution Paul Hudak presented in the "Detecting Cycles in Datastructures" thread in october. > For the problem at hand (involving the STLC)

[Haskell-cafe] Is there a notion for identity?

{- Disclaimer: I'm rather new to Haskell and completely new to this board. I may not use the correct terminology in all cases, but I hope my intention becomes clear when you have a look at the code-snippets. -} Hey ho, Is there any way two find out whether two variables refer to the sa