> Infix and symbols don't produce cache misses for the vast majority of humans
You tried to prove your theory by finding positive evidence. But the evidence is very weak and far fetched.
> which support the standpoint that symbols-and-infix arithmetics is good for humans, based on how their mind works.
Given that we largely don't know how the mind 'works', that's a weak argument.
> Show me a Lisp program with more than casual usage of arithmetics and tell my why you consider it readable.
Given that a lot math code is expressed in low-level Fortran, I'll take Lisp every day.
From a statistics system in Lisp:
(defgeneric gaussian-probability-density (x params)
(:documentation "general gaussian density method.")
(:method ((x number)
(params gaussian-probability-univariate-parameters))
(\ (exp (* -1.0 (/ (- x (mean params))
(standard-deviation params)))
(sqrt (* 2.0 pi (variance params))))))
I find that perfectly readable.
Absolutely. It's a tender flower.
> No. It's just different way of getting to the same effect. I don't see why would one be worse than the other (splitting things using infix operators vs. splitting things using horizontal and vertical whitespace).
It's very important since size matters. Efficiency of encoding and cost of decoding (~ perception) matters. But if you don't think it makes a difference -- fine, you are free to read braille instead of plain text even if you have perfect eyesight. You can also add three layers of parens around each expression if you think that's more regular.
> Do you think that we're genetically programmed for reading infix syntax?
No. There's this fact that all combinations of basic grammar are represented in natural languages: SVO, SOV, VSO, VOS, OSV, OVS. And then there are some programming languages which don't differentiate between subjects and objects, but go for (OVO), VO, VOO, VOOO... (or concatenative style OV, OOV, OOOV...). Which is great since the goal of formalism is to be "objective". (Note that Object-oriented programming is actually subject-oriented programming from this standpoint. It's not "objective")
Instead I say that it is more efficient if syntax is optimized for the common cases. Shorter is better, if the decoding won't produce more cache misses. Infix and symbols don't produce cache misses for the vast majority of humans, in the case of arithmetic (read: mostly sequential, barely tree-shaped) expressions.
Sexps are inherently unoptimized for the common cases. They are "optimized for abstraction": for regularity. It is an explicit design goal to not differentiate things which are different "only" on a very concrete level. Instead of content, form is accentuated. This is not suitable for the > 95% of real life software that is just super-concrete and where abstraction has no benefits.
I'm sure I have now given 5 to 10 quite plausible examples which support the standpoint that symbols-and-infix arithmetics is good for humans, based on how their mind works. You haven't provided any counter-arguments but just shrunk off everything. But thanks anyway for that. I think I'm satisfied now with the examples that came out.
> are you sure you're as skilled with sexps [..] as with infix?
No. Never will be.
Are you? Show me a Lisp program with more than casual usage of arithmetics and tell my why you consider it readable. By the way, the first google hit I just got for "lisp arithmetic readability" is http://www.dwheeler.com/readable/