This video is a presentation about the evolution of tailrec through the years accross some of the most well known, and some not so known languages. The goal isn't to go through all languages ever invented, but to gain a prespective about tailrec that exists already in programming languages since the 1950's. The idea is to situate us in time and understand where we come from when we talk about tailrec and tail call optimization (TCO).
---
Chapters:
00:00 Start 00:50 What is tailrec loosely speaking? 03:02 Tail recursivity through the year - The 1950's 05:05 Tail recursivity through the years - The 1970's through to 1990 08:35 Tail recursivity through the years - The 1990's through to 2016 16:49 What was the point of tail recursivity 19:25 Pseudo-code in Fibonacci 33:42 Fortran in Fibonacci 43:03 LISP in Fibonacci 52:11 COBOL in Fibonacci 57:18 Scheme in Fibonacci 01:02:51 SML in Fibonacci 01:11:56 Erlang in Fibonacci 01:17:52 Haskell in Fibonacci 01:25:55 A needed observation about Java 01:29:01 Scala in Fibonacci 01:42:45 Clojure in Fibonacci 01:49:00 Kotlin in Fibonacci 01:56:48 Conclusion and philosophical thoughts 02:06:29 Questions 02:08:42 See you in the next video! 02:09:29 Disclaimers
---
Presentation
- Powerpoint on Scribd - https://www.scribd.com/presentation/712473423/Exploring-Tailrec-Through-Time-Until-Kotlin - Powerpoint on Slide-Share - https://www.slideshare.net/slideshows/exploring-tailrec-through-time-until-kotlinpptx/266732636
As a short disclaimer, I'd like to mention that I'm not associated or affiliated with any of the brands eventually shown, displayed, or mentioned in this video.
---
All my work and personal interests are also discoverable on other different sites:
If you have any questions about this video please put a comment in the comment section below and I will be more than happy to help you or discuss any related topic you'd like to discuss.
If you want to discover more about my open-source work please visit me on GitHub at:
