first draft of recursion, thunks and trampolines

Author: MagnusSmith

_posts/2025-04-11-recursion-thunks-trampolines-with-java-and-scala.md

@@ -160,8 +160,7 @@ Instead of relying on the JVM, Scala implements Tail Call Optimisation at the co
 1. **Detection**: The Scala compiler (`scalac`) analyses the code to detect methods that make recursive calls to themselves in tail position. Remember, a tail position call is the absolute last action performed by the method before it returns.
 2. **Transform into Iteration**:  Once the compiler has identified a self-recursive tail call, it rewrites the recursive method into an **iterative** one in the generated JVM bytecode.
     - Updates to the method's parameters (as if they were local variables).
-    - A jump (like a _goto_ in bytecode terms) back to the beginning of the method's logic. This effectively creates a
-      while loop structure within the bytecode.
+    - A jump (like a _goto_ in bytecode terms) back to the beginning of the method's logic. This effectively creates a while loop structure within the bytecode.
 3. **Reuse Stack Frame**: By replacing the recursive call with parameter updates and a jump within the same method, no new stack frame is pushed onto the call stack for the "recursive" step. The method re-runs its logic with new values
    within the existing stack frame.
 4. **The `@tailrec` annotation**: Including the annotation tells the compiler to attempt to optimise the method for TCO. If it then fails because the method annotated is not direct self-recursion or in the tail position then it will raise an