Definitely not Java! A Hands-on Introduction to Efficient Functional Programming with REASON
summary
SAP uses ReasonML (compiles to OCaml/JS, runs on Node) to build a live Master Data Integration (MDI) service and claims code is simple, fast and type‑safe with strong inference so developers rarely add type annotations. Examples show implementing a binary tree, linked list and an immutable FIFO queue that uses two lists, and demonstrate that naive recursion overflows while a tail‑recursive rewrite (compiler-optimized into a while loop) handles a 10,000‑element list successfully. The code and refactors compile and run, and the tooling surfaces missing cases to catch bugs.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:38My Experience with Functional Programming
- 1:15Stack Overflow Developer Survey
- 2:12Compensation
- 3:05SAP
- 4:44Reason ML
- 5:39Declaring Variables
- 9:12Type Inference
- 12:39Binary Tree
- 13:06Pattern Matching
- 20:32Community
- 21:47Linked List
- 22:46Implement Linked List
- 25:09Preprint Linked List
- 31:41Java Linked List
- 39:54Tuple Queue
- 52:56Examples
related talks
01h 44mFunctional Programming: Technical Reasons to Adapt
44mFunctional Programming You Already Know
36mConcrete Functional Programming
51mFunctional Programming with Java
36mHow Functional Programming Can Make Life Easier
49mRelax, It's Just FP
44mBenefits of Functional Programming Beyond map/filter/reduce
34mPrinciples of functional programming with examples in Java and Haskell