Earlier quoted context omitted.
Can't do much FP in Kotlin. Unless your definition of FP is programming with lambdas.
I agree. One thing that is sorely missing, for example, is a way to define recursive values. In Scala, to express a recursive parser combinator: val e = p | e You can't define such a thing in Kotlin. Atleast, this was the case the last time I looked at it.
val e = p | e
in Scala? How does that work with eager evaluation?