Compile Common Stack Automaton to lambdas

[kamil-adam]

Before compile, we have to do these optimize:

• Cut to Basic Blocks, Find leaders
• Inline expansion (mother of all optimization) - Remove calls
• Dead-code elimination
• Loop unrolling
• Relooper - GOTO Elimination Algorithm
• Use Profiling https://downloads.haskell.org/ghc/latest/docs/users_guide/profiling.html

---

• Transform IL to Blocked Instruction List - every block start from label (static/string label or dynamic/natural label)
• Use StateMonad RuntimeContext (Option Label) for lambdas
  • None is next block
• Wrap lambdas by custom continuation.

---

Required:

• Common Stack Automaton Should be faster - Peephole optimization #112
• FB should be faster #106