The document discusses efficient functional programming with Reason, focusing on data structures and operations like inserting and popping values from lists. It introduces tail recursion and its transformation into a while loop for constant stack size, as well as the continuation-passing style pattern. Additionally, it directs readers to try Reason on the resonml.github.io website.

1. Definitely not Java! A Hands-on Introduction to
Efficient Functional Programming with REASON
Carlo Fürst, Jonas Traub, Arne Artur Schulze

36. Summary
- Whenever we insert a value, we prepend the value to the top list.
- Whenever we pop and the bottom list is empty,
we revert the top list into the bottom list.
- Whenever we pop a value and there is at least one values in the
bottom list, we pop the first value from the bottom list.

40. Introduction to
Tail Recursion

52. compiles to
recursive
function

53. compiles to
while loop
=>
constant
stack size

55. How to transform recursive
functions into tail recursive
functions?
Take a look at the
”Continuation-Passing Style”
pattern

56. Try REason on
resonml.github.io

57. Try REason on
resonml.github.io