The intercalation operation is very useful because it acts between components, which is the place where an infix operator is specified. It also simplifies the specification of expressions.
Ejemplos
a⊣(x and z) // rep. (x to y to z) eq. xayaz
+⊣(a b c) // rep. (a + b + c) eq. a+b+c
^⊣(a b c) // rep. (a ^ b ^ c) eq. a^b^c
*⊣(1 3 5) // rep. 1*3*5 eq. 15
←⊣(a b c) // rep. (a ← b ← c)
+⊣( 1...10 ) // rep. 1+...+10 rep. 55
*⊣( 1...10 ) // rep. 1*...*10 (factorial of 10)
ab⊣(xyz) // rep. (x ab y ab z)
((+a+)↓ ⊣ xyz) // rep. x+a+y+a+a+z
abc⊣abc // rep. (a abc b abc c)
α⊣1234 // rep. 1α2α3α4
(u★3)⊣(a b c) // rep. (a u★3 b u★3 c) rep. auuubuuuc
(1...5)⊣(a b c) // rep. (a 1...5 b 1...5 c) rep. a12345b12345c
()⊣(a b c) // rep. (a () b () c) (empty sequence interleaving)
Remarks
Intercalation is also called "internal distribution". Since the evaluation is top-down hierarchical, the distribution operator takes precedence. Thus, for example,
x⊣(θ θ θ θ) // rep. (θ x θ x θ) rep. (x x)
It follows from the definition that when the sequence has only one component, the expression is self-evaluating. Examples:
The derivative "intercaltion" has been defined as descriptive (like the distribution), but it could also be defined as operational, by immediate substitution.
Higher order intercalations
a⊣((b c)⊣(u v w)) // rep. a⊣(u bc v bc w) rep. (u a bc a v a bc a w)
(ab⊣ab)⊣ab // rep. (a ab b)⊣ab rep. (a ab ab ab ab b)
ab⊣(ab⊣ab) // rep. ab⊣(a ab b) rep. (a ab ab ab ab b)
x⊣(x⊣(a b c)) // rep. x⊣(a x b x c) rep. (a x x x b x x x c)
Therefore, (x⊣(x⊣(a b c)) ≡ ((x★2)⊣(a b c))
En general, 〈( x⊣(x⊣y) ≡ ((x★2)⊣y) )〉
Properties
〈( θ⊣x = x )〉 // null expression interleaving