this is a funny trick, and it looks saner than the more general $ *
combinators.
i see many situations where i could use that to lift my own combinators,
or to replace the backticks (``) to lift the infix function.
thx
- marc
Gesendet: Freitag, 27. September 2013 um 21:51 Uhr
Von: Thiago Negri
very insightful, thx Jerzy.
imho, this is a good reason not to use already known words like
lift,return,inject,pure etc. while still using the word Monad. (this is
something that bothered me for years.)
no one -of those who say no one- does understand Monads because it does not
explain itself
i get this spam whenever anyone sends a mail to @eukor.com and this list at the
same time.
i think that this kind of spam-bot sends to all recipients, not only to the
person who sent it; but sends only if it sees @eukor.com in the TO: or CC:
field.
so, if anyone knows a similar
O_o
Those are damn strange reasons to restrict oneself to 80 chars, iMho.
I tend to look at ONE file at a time, on one fullscreen widescreen.
100 chars per line is more or less normal; I have my vertical line limit marker
set to 100, but only for layout-zen. My lines have sometimes 200 chars
Hi Thomas,
this should be on the haskell-cafe or haskell-beginners mailing list.
Haskell@... is mainly for announcements.
You have:
f :: Monad m =
a - m b
Data.Traversable.mapM :: (Monad m, Traversable t) =
(a - m b) - t a - m (t b)
So, if you define g with
g
you are right, that pice of code is ugly. i would write sth simmilar
(Int32-[Word8]) like you did, iff it should be able to cross-compile or do not
need to be fast or should not need TH.
well, i think, in the case of joel's project the last sentence means ..., iff
true or true or undefined.
is
well, fastest conversion to compute could be an assembler-command, but if we
don't use that, it could be converted via Foreign.Storable and sth like the
following: (i did not test it, and i hope, TH works like this...)
data (Integral a) = BigEndian a = BigEndian a deriving (Eq,Ord,Enum,...)
be
for just making IO and a little bit-conversion, i would use c++ or even c. for
such a problem you have to be near the machine, not necessarily near
mathematical abstraction.
there exist assembler-commands to flip endians of register-values, so i would
just search in /usr/include/*/* for a
nice project. (except that winonly-closedsource-thing. my condolence.)
on which platform are you programming? mac? linux-ppc?
i see that you understood most of that code.
big-endian-test: the number 1234 has two ends (like a sausage), the end with
the 1 is the big end (1000), the 4 is the
maybe, i completely missunderstand you. please, could you program your example
in another language than haskell, one you know better?
i'm not sure -- did you try to define variables instead of types?
data Employee = Emp
data Department = Dept
translated to c++ this means sth like
typedef void
map (foo 5) my_list_of_lists_of_doubles
1. map (flip foo 5) my_list_of_lists_of_doubles
2. map (`foo` 5) my_list_of_lists_of_doubles
3. map (\x-foo x 5) my_list_of_lists_of_doubles
4. [foo x 5 | x - my_list_of_lists_of_doubles]
well, i've followed this discussion a while, but i did not see
11 matches
Mail list logo
