[Haskell-cafe] A thought on the LinkedIn spam and an "upstream spam filter"

/Do_Not_Disturb_%28telecommunications%29 Thanks and regards, -Damodar Kulkarni On Mon, Sep 23, 2013 at 12:43 AM, MigMit wrote: > So, instead of emailing this guy and asking him to change the address in > his LinkedIn profile (which is simple, since he did write a lot to café), > you decided

Re: [Haskell-cafe] Minh Thu, please add me to your LinkedIn network

What a surprise, I didn't know the real name of "Haskell Cafe" till date, BUT today I came to know it: it is Minh Thu V. linked in sucks ... Thanks and regards, -Damodar Kulkarni On Sun, Sep 22, 2013 at 2:53 PM, Kyle Hanson via LinkedIn < mem...@linkedin.com> wrote: &

Re: [Haskell-cafe] Mystery of an Eq instance

em the detailed knowledge of all the intricacies of handling equality for floating points... as anyway they themselves are asking for it and they are NOT relying on the Haskell's Num typeclass for it. Thanks and regards, -Damodar Kulkarni On Sat, Sep 21, 2013 at 9:46 AM, Mike Meyer wrot

Re: [Haskell-cafe] Mystery of an Eq instance

n)") I know I might be wrong in expecting this change as it might break a lot of existing code. But why not daydream? [1] Please read His/Her Thanks and regards, -Damodar Kulkarni On Fri, Sep 20, 2013 at 10:04 PM, Stijn van Drongelen wrote: > On Fri, Sep 20, 2013 at 6:17 PM, damodar k

Re: [Haskell-cafe] Mystery of an Eq instance

of the Num class? Thanks and regards, -Damodar Kulkarni On Fri, Sep 20, 2013 at 5:22 PM, Scott Lawrence wrote: > On ghc 7.6.3: > > Prelude> 3.16227766016837956 > 3.1622776601683795 > > So if you specify a number with greater-than-available precision, it will > be trun

[Haskell-cafe] Mystery of an Eq instance

nt types be considered "meaningful"? If yes, how? In general, programmers are **advised** not to base conditional branching on tests for **equality** of two floating point values. 3. Is this particular behaviour GHC specific? (I am using GHC 6.12.1) If there are references on this please shar

Re: [Haskell-cafe] stream interface vs string interface: references

might think of. It doesn't quite seem to be the 'kiss' principle i.e. "keep it simple stupid". What is really behind the Smalltalk's decision? Thanks and regards, -Damodar Kulkarni On Tue, Sep 3, 2013 at 12:06 PM, Richard A. O'Keefe wrote: > > On 3/09/201

[Haskell-cafe] stream interface vs string interface: references

king for pointers that explain the rational behind the above claim made by O'Keefe. and what is the take of Haskell on this topic? Thanks and regards, -Damodar Kulkarni ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] definition of the term "combinator"

Thanks. I found the explanation given at the link quite useful in shedding the confusion I had had. Thanks and regards, -Damodar Kulkarni On Sat, Aug 24, 2013 at 10:57 AM, Jason Dagit wrote: > > > > On Fri, Aug 23, 2013 at 9:09 PM, damodar kulkarni > wrote: > >

[Haskell-cafe] definition of the term "combinator"

bservation holds, is the term combinator as used in the Haskell community, properly defined? In other words: Where can I find a formal and precise definition of the term "combinator", as a term used by the Haskell community to describe "something"? Ref: http://en.

Re: [Haskell-cafe] Applicative is like an Arrow

more systematic manner, by using what they call "Monad coproduct". The paper titled "Composing Monads Using Coproducts" is here. [1] I haven't understood it much till now, and it seems I will have to try real hard to read this paper. Ref. [1] http://isi.uni-bremen.

Re: [Haskell-cafe] Applicative is like an Arrow

ugly (again, please correct me if I am wrong) I wonder, where and how the Monad transformers fit in here? Thanks and regards, -Damodar Kulkarni On Sat, Aug 17, 2013 at 1:07 AM, Mathijs Kwik wrote: > Thiago Negri writes: > > > I just stumbled upon the Applicative term. > > Ar

Re: [Haskell-cafe] Alternative name for return

s) he/she had had in his/her mind while giving a particular name to a given concept? It will help others to share *at least some amount of* of intuition (analogy) the originator had had. Are such thoughts documented in this case? Thanks and regards, -Damodar Kulkarni On Wed, Aug 7, 2013 at 1

Re: [Haskell-cafe] Alternative name for return

erson who uses the different words to mean the same thing, while a mathematician is a person who ascribes more meanings to the same word. Haskell, being originated from _mathy_ people, we do get to _enjoy_ this effect. Having said this, it has actually helped me build a different type of &#x

Re: [Haskell-cafe] need help with understanding expression

Hi, Thanks for the clarification. This is clearly depravity. I am confused, in what sense this is depravity? Damodar On Sun, Nov 18, 2012 at 7:27 AM, Albert Y. C. Lai wrote: > On 12-11-17 02:19 AM, damodar kulkarni wrote: > >> Let's see tthis: >> Prelude> :t 3 &

Re: [Haskell-cafe] need help with understanding expression

h a sequence of compositions is > to use ($): > > Prelude> :i ($) > ($) :: (a -> b) -> a -> b -- Defined in GHC.Base > infixr 0 $ > > Note that it has the lowest possible precedence. So, you often see the > composition of functions as f . g . h $ arg. But this doesn't work

Re: [Haskell-cafe] Why Kleisli composition is not in the Monad signature?

@Jake In my opinion, this is not as nice as the do-notation version, but at > least it's compositional: That's an important point you have made, as Haskellers value code composition so much. If code composition is the "holy grail", why not encourage the monadic code, too, to be compositional? Ni

[Haskell-cafe] Why Kleisli composition is not in the Monad signature?

Hi, The Monad class makes us define bind (>>=) and unit (return) for our monads. Why the Kleisli composition (>=>) or (<=<) is not made a part of Monad class instead of bind (>>=)? Is there any historical reason behind this? The bind (>>=) is not as elegant as (>=>), at least as I find it. Am I

[Haskell-cafe] Benchmarks for graph algorithms

Hi cafe, Where do Haskell and DPH stand in comparison to C/OpenMP w.r.t. graph algorithms? Are benchmarks for graph algorithms available for Haskell like the ones we find at http://www.graphanalysis.org/benchmark/? - Damodar ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] Is Hackage down?

It shows hackage down: http://www.downforeveryoneorjustme.com/http://hackage.haskell.org/ - damodar On Fri, Sep 14, 2012 at 10:33 AM, C K Kashyap wrote: > Is it just me or is Hackage indeed been going down more frequently of late? > > Regards, > Kashyap > > > ___

Re: [Haskell-cafe] Invitation to connect on LinkedIn

Hi, Correct me if I am wrong, but by looking at the way the message is created, I think, LinkedIn is acting a kind of spammer these days. Shall we lodge protest against it as a community? As an aside, can we not automatically delete all messages to haskell mailing-lists whose "from" field contains

Re: [Haskell-cafe] Function names in Haskell lib not first-class on web!

thanks for the symbolhound link. @Kristopher: I knew hoogle to some extent, not an expert user though. and, it seems, the "hoogle plugin for firefox" works only for haskell.org Damodar On Fri, Aug 31, 2012 at 8:07 PM, Brandon Allbery wrote: > On Thu, Aug 30, 2012 at 11:2

[Haskell-cafe] Function names in Haskell lib not first-class on web!

Hi Cafe, It seems, the function names in Haskell libs are not first-class objects, AT LEAST when it comes to searching for them of the net! I was trying to search for the following Haskell functions in the mailing list archives. Here is a summary of the responses I have had from various servers upo

Re: [Haskell-cafe] [Haskell] Spam on the Haskell wiki

Hi Gwern, First of all, thanks for your patience. I am willing to do administrator tasks. > > 4. ReCAPTCHA enabled for 'edits adding new, unrecognized external >> links' - which is all of the spam. >> > > This is already enabled. > I guess the problem may be due to "ReCAPTCHA

Re: [Haskell-cafe] [Haskell] Spam on the Haskell wiki

> We could even have a "report spam" button on each page, and if enough > users click on it (for a given revision), the revision gets forwarded to a > moderator. I think, this will be of real use, but should be used along with CAPTCHA because then spammers may "report spam" for everything and an

Re: [Haskell-cafe] Reddy on Referential Transparency

So a language is referentially transparent if replacing a sub-term with > another with the same denotation doesn't change the overall meaning? > But then isn't any language RT with a sufficiently cunning denotational > semantics? Or even a dumb one that gives each term a distinct denotation. Tha

Re: [Haskell-cafe] Martin Odersky on "What's wrong with Monads"

Any idea whether Martin Odersky has read this discussion? Thanks and regards, -Damodar Kulkarni On Fri, Jun 29, 2012 at 12:23 AM, Dominique Devriese < dominique.devri...@cs.kuleuven.be> wrote: > 2012/6/27 Tillmann Rendel : > > MightyByte wrote: > >> > >> Of

Re: [Haskell-cafe] The use of continuation monad in C++

Hello, Thanks for the post. It was very useful to me in getting some insight into this set of concepts. Also your others posts on C++ and FP are very useful. Damodar On Thu, Jun 21, 2012 at 1:17 AM, Bartosz Milewski wrote: > I published a blog for C++ programmers about the advantages of using th

[Haskell-cafe] filter using foldr point-free?

Hi, We can define filter using foldr as under: filter1 p = foldr (\x xs -> (if (p x) then (x:xs) else xs)) [] Can we define filter using foldr but in pointfree style? Thanks -DM ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell

Re: [Haskell-cafe] Counting beta reductions for a Haskell program...

Yes Hugs has a option "+s" but it counts some sort of reductions not exactly the beta reductions. Thanks. -Damodar 2008/11/22 Adrian Neumann <[EMAIL PROTECTED]> > Hugs has, afaik, a "output reduction count" option somewhere. At least it > had one the last time I used it. > > - Adrian > > Am 22.11