The S K I combinators were developed as the equivalent of assembly language for functional programs. In reality, expanding a lambda expression into SKI combina

The S K I combinators were developed as the equivalent of assembly language for functional programs. In reality, expanding a lambda expression into SKI combinators takes up a lot of space. Since the notation is mainly for language implementors, using the short mnemonics allows you to compress the size of the resultant expression. It's the same reason why the x86 opcode is named 'mov' not 'move'.