Computation Expressions in Scala
summary
Claims a concrete implementation of Computation Expressions for Scala that delivers fail-fast futures missing from vanilla for-comprehensions by translating code into applicative apply/zip when possible and falling back to monadic bind only when needed. Demonstrates working code, uses Scalaz and shapeless, compares to async/await and Twitter futures, and reports a thorough test suite. Notes practical limits: complex pattern-match desugaring and JVM thread cancellation remain tricky, and some edge cases in macros are not yet solved.
AI-written summary · about
chapters (17)
- 0:00Intro
- 0:24History
- 5:42How did we solve it?
- 6:54Features
- 8:07Failing fast
- 9:15Interacting with if
- 11:13Using another abstraction
- 12:43Based on Scalaz
- 13:54Simple code transformation
- 15:00Importance of using the
- 15:45Monad is required
- 16:17if statement
- 17:08match statement can get hairy
- 18:39Similar Projects
- 21:16Limitations
- 24:00Write Async code
- 26:33Future work
related talks
46mOptimusPrimeT
01h 00mWhat The Functional Programming
18mEasy, intuitive, direct-style syntax for Monad-comprehensions!
59mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 3 of 6
27mComputation expressions in context
49mTrading in Futures
32mApplicative: The Origin Story
24mLet the Scala compiler work for you