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@haskell.org
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 reasons for
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 [...]
[...] 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
Oh my lord, I love how my newreader obfuscates my posts.
= span
http://undergraduate.csse.uwa.edu.au/units/230.301/lectureNotes/tourofprelude.html#span
p' xs
where
p' x = not
http://undergraduate.csse.uwa.edu.au/units/230.301/lectureNotes/tourofprelude.html#not
(p x)
= span p'
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
[...] 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
It can be found here: http://citeseer.ist.psu.edu/424440.html
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*)
___
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),
{- 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
10 matches
Mail list logo
