return

consider this term rewriting rule, it's as simple as can be:

when i clap my hands two times (👏👏.), the terms separated by the '👏:' operator go from left to right.

(don't worry about problems like striding and overlap, the '.' denotes a sequence breaking pause.)

here's an example:

great big very 👏: small.
"a great big very problem appears for us."
=> 👏👏.
=> small 👏: small.
"a small problem appears for us."

the astute reader will notice that 👏-rewriting is so brutally simple that it does not have scoping rules. if you hit that clap rewriter, your terms are CLAPPED. there is no room for piddling about here.

okay now here we go:

width👏:letter1👏:m. height👏:letter2👏:n.
"a matrix has width 43123 and height 3."
=>👏👏.
=>
letter1👏:m👏:m. letter2👏:n👏:n.
"a matrix has letter1 43123 and letter2 3."
=> 👏👏.
=> 
m👏:m👏:m. n👏:n👏:n.
"a matrix has m 43123 and n 2."

now that we have established a formal bridge between ensembles of letters, ensembles of letters but the ensemble is different, and singular letters as used in the garish and incompetent notation of the elder clowns, we have learned a deep and powerful lesson.

emojis are really funny. no, uh.
term rewriting systems are really basic. no, uh.
people who use notations they do not like are disavowing and abnegating the literal tools of their formal systems, or perhaps expressing a preference for less rigor and more confusion.

oorrr...

👏AND :.👏:  🪤  .
👏AND : 👏: 📦.
AND 👏: {}.
👏👏.
👏👏.

1. what's an algorithm lol
1.1 like is algorithm when you're 'counting', 
and you move an abacus bead at the same time you move your finger over a group of items?
|🔴⭕️⭕️⭕️|, 👉🦎🦎🦎;
COUNTPARTIAL;
|👉🔴⭕️⭕️⭕️|, 👉🦎🦎🦎;
|⭕️👉🔴⭕️⭕️|, 🦎👉🦎🦎;
COUNTDONE:
|⭕️🔴⭕️⭕️|, 🦎👉🦎🦎.

🦎🦎🦎
🦎🦎🦎🦎
🦎🦎🦎🦎🦎

🌨

🦎🦎🦎 ->bigcount->🌨
🦎🦎🦎🦎 ->bigcount->🌨
🦎🦎🦎🦎🦎 ->bigcount->🌨

🌨 ->bigcount-> 🦎🦎🦎
🌨 ->bigcount-> 🦎🦎🦎🦎
🌨 ->bigcount-> 🦎🦎🦎🦎🦎

3.3.6 in fact it's so simple that you might miss it even with 300 years of economics textbooks!
3.3.7.1 INVARIANT:BCOUNT:{🦎 ->bigcount->🌨} -> {🦎🦎🦎 -> 🌨 }.
3.3.7.1 VARIANT:BCOUNT:{🦎 ->bigcount->🌨} -> {{ -> 🌨 } {🦎 -> 🌨 } {🦎🦎 -> 🌨 }}.

3.3.7.4 INVARIANT:BCOUNT:{🌨 ->bigcount->🦎} -> {🌨 -> 🦎🦎🦎 }.
3.3.7.5 VARIANT:BCOUNT:{🌨 ->bigcount->🦎} -> {{🌨 ->  } {🌨 -> 🦎 } {🌨 -> 🦎🦎 }}.

3.3.8 what is philosophically interesting (about defining stochasticity after rigorously defining counting) about BCOUNT is that BCOUNT has predictable behavior! you know that a bcount of any number of lizards which produced {🌨🌨🌨&🦎} has concrete limits for...

『ＳＥＣＯＮＤ　ＣＯＵＲ　ＬＯＧＩＣＩＡＮ　ＢＲＥＡＫＥＲ　ＤＯＵＢＬＥ　ＵＬＴＩＭＡＴＥ』

『ＨＥＬＬＴＨＲＥＡＤ’Ｓ　ＣＯＤＡ』