Share on Mastodon
You read it here first, but now you can have a paper version of “Tail Call Optimisation in C++”, published almost as-is, in Overload 109 the journal of ACCU.
Category: Programming Languages
Scheme 5: Quotation video
Series: Feel the cool, Basics, Closures, Recursion, Quotation, Lambda, Macros.
Continuing the series on Scheme, this video explains on of the most powerful and unfamiliar features of Scheme: quotation. Quoting allows us to talk about and manipulate code in code, as easily as we deal with strings or numbers.
Scheme 4: Recursion – how to write functions in Scheme video
Series: Feel the cool, Basics, Closures, Recursion, Quotation, Lambda, Macros.
Continuing the series on Scheme, this video describes the way you write code in Scheme: recursion. Recursive functions can be pretty efficient in Scheme, if you structure them right, and the video covers the concept of a tail call, which is the most important way of doing this.
Scheme 3: Closures video
Series: Feel the cool, Basics, Closures, Recursion, Quotation, Lambda, Macros.
Continuing the series on Scheme, this video describes an important feature of functions in Scheme: closures. Closures allow functions to carry their “environment” around with them, and even change it later. This allows all kinds of exciting things, including implementing something similar to classes in other languages.
Scheme 2: Basics – pairs and lists video
Series: Feel the cool, Basics, Closures, Recursion, Quotation, Lambda, Macros.
Continuing the series on Scheme, this video describes some of the things you will need to understand to be able to write real programs. I introduce pairs, lists, and navigation through lists using recursive procedures, before discussing the map and foldr procedures, which you will use in most programs.