Table exercise: transposing, row elimination, and column elimination. | On slide | - |
tail | On slide | - |
Tail Calls | On slide | - |
tail recursion | On slide | - |
Testing functional programs | On slide | - |
The fluid-let namebinding construct | On slide | - |
The let* name binding construct | On slide | - |
The let* name binding construct | On slide | - |
The let name binding expression | On slide | - |
The letrec namebinding construct | On slide | - |
The alpha rewrite rule | On slide | - |
The append function | On slide | - |
The beta rewrite rule | On slide | - |
The capturing of continuations | On slide | - |
The cartesian product of two sets | On slide | - |
The catch and throw idea | On slide | - |
The Challenge | On slide | - |
The equivalent meaning of let | On slide | - |
The eta rewrite rule | On slide | - |
The filtering function | On slide | - |
The function butlast | On slide | - |
The function concept | On slide | - |
The get-prop function for property lists | On slide | - |
The idea of currying | On slide | - |
The interpretation of self | On slide | - |
The intuition behind continuations | On slide | - |
The mapping function | On slide | - |
The ordering of reductions | On slide | - |
The read-eval-print loop - REPL | On slide | - |
The reduction functions | On slide | - |
The zipping function | On slide | - |
Theoretical results | On slide | - |
time elucidative program | On slide | - |
tools - in Lisp | On slide | - |
Trampolining | On slide | - |
Trampolining a recursive factorial function without tail calls?! | On slide | - |
Types | On slide | - |
types - advantages of | On slide | - |
Typing and Typecheck | On slide | - |