women in software

Usually people are worried about girls not choosing the programmer's profession and doing other things instead.
Okay, this is weird, yes.

But where are the middle-aged female programmers? This looks totally strange to me. They would not be afraid to be intimidated by young assholes (they usually don't care), they would have knowledge and experience. Where are they?

A disclaimer. Back in the USSR, my team mostly consisted of female programmers over 30 (and 40); and I pretty much know their advantages. Reliable readable software, not prototypes that young male hackers tend to slap together (prototypes are okay, if we know they are prototypes, not production-level software).

So, what happened?

 

 

сяу

Что разъебанные Израилем в Сирии российские комплексы С-300, во-первых, были муляжами, во-вторых, были еще не развернуты, в третьих, были под управлением неопытных арабов.

Ну это все объясняет, конечно.

А вот что мне Dschera подсказала

Если у вас есть Амазон прайм, так там до хрена хорошей музыки! Бесплатно! Я не ушел обиженным! Наслаждаюсь! Сейчас мне Лунную играют, например. Ура, ура, ура. 

ok, it does not seem to be doable

Basically, I have two, e.g. GraphMorphisms, and I want to compare them. This theory is supposed to be equational, right? Is it?
In short, I could not figure out.

So I decide, let me take a look, how do they compare two typed sets in Scala? Here's how:

  override def equals(that: Any): Boolean = that match {
    case that: GenSet[_] =>
      (this eq that) ||
      (that canEqual this) &&
      (this.size == that.size) &&
      (try this subsetOf that.asInstanceOf[GenSet[A]]
       catch { case ex: ClassCastException => false })
    case _ =>
      false
  }

So there. Maybe it's not equational, after all. I mean, in my case.

How do they do it in Haskell then? This is how:

instance Eq1 Set where
    liftEq eq m n =
        size m == size n && liftEq eq (toList m) (toList n)

Typeclasses seem to beat classes. Fuck...