How to Catch Recursion by the Tail
summary
The talk examines tail-recursion elimination in the Java ecosystem: whether and how tail-recursive calls can be replaced with loops in Java, which JVMs perform such optimizations and whether that’s allowed, and what third-party tools can help optimize functional-style Java code. It also surveys JVM-friendly functional languages (Scala, Kotlin, etc.) that offer stronger functional features and may handle tail recursion more directly.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 2:09Tail recursion
- 8:55Tail recursion optimization
- 13:54Tail recursion in IDE
- 19:34Tail recursion in bytecode
- 23:49Predictability issues
- 29:46Tail recursion in Scala and Kotlin
- 38:01JVM optimization
- 47:00JVM performance comparison
- 51:32Stack traces and tail recursion
- 54:23Summary
related talks
43mRefactoring Without the Fors
52mFunctional Programming with Java 8
01h 02mFunctional Programming in Java, Groovy, and Kotlin
43mFunctional Programming in Java, Groovy, and Kotlin
51mFunctional Programming with Java
36mHow functional programming change my Java code
01h 12mThe Power of JVM Language
51mHitchhiker's Guide to Functional Programming