mix-fix notation ^-^

mix-fix.cicada

===================================

with the following principle
  1 2 (add) = 1 (add 2) = (add 1 2)      
all the following code blocks eval to the same result
i.e. function called "fun" applys to arguments 1 2 3

-----------------------------------

2 1 (sub)
2
1 2 (add)
(fun)

-----------------------------------

2 1 (sub)
(fun 2  
     1 2 (add))

-----------------------------------

(fun (sub 2 1) 
     2
     (add 1 2))

===================================

the following use named arguments
the names are used when applying (not when defining)
thus
the order of arguments in the argument-stack is not important anymore

-----------------------------------

2 1 (sub) <:arg1
2         <:arg2
1 2 (add) <:arg3
(fun)

-----------------------------------

2 1 (sub) <:arg1
(fun 2         <:arg2
     1 2 (add) <:arg3)

-----------------------------------

2 1 (sub) <:arg1
(fun (arg2:> 2)         
     (arg3:> 1 2 (add)))

-----------------------------------

(fun (arg1:> 2 1 (sub))
     (arg2:> 2)         
     (arg3:> 1 2 (add)))

-----------------------------------

(fun (arg1:> (sub 2 1))
     (arg2:> 2)         
     (arg3:> (add 1 2)))

-----------------------------------

after playing with the above syntax for a while

I found that clojure and racket are already using similar syntax [by macro "~>" and family]

http://www.greghendershott.com/rackjure/

they come up with the syntax from the root of lisp

but with a concrete stack semantic

mine will be more flexible