(Recursive) Functions Decoded
summary
This talk examines functions—especially recursive ones—by explaining evaluation strategies (strict vs lazy), kinds of recursion (simple, mutual, tail), and techniques like trampolines. It also covers how function calls are compiled and what conditions allow optimizations, linking operational semantics down to machine-level translation. Expect concrete discussion of implementation details and some formal semantics.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 2:31EVALUATION STRATEGIES
- 9:18SEMANTICS
- 13:38COMPILATION
- 15:10LET'S START SIMPLE.
- 16:53FORTRAN
- 18:47SIMPLE RECURSION
- 19:35MUTUAL RECURSION
- 20:30IMPLEMENTATION
- 22:56STACK NOT INCLUDED
- 24:47EVOLUTION OF PROCESSORS
- 30:44TAIL CALL
- 32:50IMPLEMENTATION
- 33:58GENERATED CODE
- 36:31HOW TO BOUNCE BACK?
- 37:50TRAMPOLINE
- 40:22AND THEN?
- 41:18RESOURCES
related talks
29mIntroduction to Recursion Schemes
56mAn introduction to recursion schemes
31mThe Shoulders of Giants or Uncovering the Foundational Ideas of Lisp
01h 02mGoing bananas with recursion schemes for fixed point data types
41mFunctional Programming for Dummies*
21mλ-Calculus: A Brief History of Functional Programming
47mHands on With Recursion Schemes - Part 1 of 2
53mY Not- Adventures in Functional Programming