I was wondering on something. Famous programming language people like Larry have the power to call attention in a subtle way upon something he or she thinks is important.

For example, suppose that Larry thinks the Stirling numbers are useful. He adds a little hidden feature to the builtin bind so when it's called with an extra argument, it stores the Stirling number indexed by the socket address to the extra arg. He adds one or two lines to the perldoc. People read the perldoc and start wondering what Stirling numbers are. They look them up, decide it's not what they need. They might not even remember later why they looked Stirling numbers up in the first place. But later, when Stirling numbers are actually needed, lots of people will have heared about it, and as they see that others have heared about it too, they think it might be important.

As far as I know, perl's bind doesn't do Stirling numbers, but I swear I first heared of the Bessell function from the manual of bc documenting its standard library (which is small: it has exp, log, sin, cos, atan2, and some bessell function). Later I've met Bessell-functions used once in an actual proof, and another times in a book. Then there's this wierd matrix-or operation which I haven't really seen used yet, but I keep wondering because both Iverson and Knuth have short references to it in documentation. Also, I'd probably have dismissed call-cc as just another silly abstraction functional programmers play with has it not been added to R5RS. And there must be other examples I can't even remember.

So, definers of future popular programming languages, use your powers wisely.

Did anyone have an experience similar to this?

(This is a lightly rewritten version of a rant I typed in the CB this morning.)

Update 2011-11-09: xkcd://591 is slightly related: it shows how to use this power as a weapon.

Update 2012-04-09: Irregular Webcomic strip 2635 (from 2010) also illustrates the concept well.

Replies are listed 'Best First'.
Re: A power of famous programmers
by oyse (Monk) on Dec 23, 2007 at 10:52 UTC

    I don't think this is exclusive to famous programming language people. Anyone that is a read by a large number of people can do somehing similar.

    There seems to be a pattern where someone famous/smart mention something rare/obscure/unknown and then more and more people look into it before it reaches some critical mass and become mainstream.

    In the programming language world Haskell and Erlang seems to be examples of this, but that may because of my ignorance.

Re: A power of famous programmers
by toma (Vicar) on Dec 24, 2007 at 09:20 UTC
    The effect you mention can be either subtle or you can be hit over the head with it. For example, I was totally nerd-sniped by xkcd the other day.

    It has also happened to me with Confluent hypergeometric functions especially in Abromowitz and Stegun. It looks like Math::Cephes has both the Hypergeometric and the Bessel functions, and even the more useful (to me) modified Bessel functions.

    I've learned a lot of things over the years that I haven't used yet. I consider it to be 'backlog' at least until I forget it!

    It should work perfectly the first time! - toma

      By the way, I believe Math::GSL::SF also has modified Bessel functions and confluent hypergeometric functions.

Re: A power of famous programmers
by ww (Archbishop) on Jun 14, 2012 at 12:55 UTC
    Believe oyse may have hit a nail on the head by going an extra step.

    Bear witness,

    • A certain Abbot posts a meditation on spreading memes.
    • Another monk reads the mediation and (despite knowing full-well that the topic will probably be over his head) promptly searchs and then reads about Stirling numbers (of both the first and second kind)...
      and
    • posts an additional mediation about the impact of prior replies to the first, thereby prolonging the chain, thus extending (.o0 ??) the impact of the OP.
    • Who knows? Stirling numbers may soon become a core part of the new, "New Math" curriculum in our primary schools.

    Is there any recursion here?   :-)