| Tables as lists of rows |
On slide |
In textbook |
| tables in HTML |
On slide |
In textbook |
| Tables with higher-order functions |
On slide |
In textbook |
| tail |
On slide |
In textbook |
| tail recursion |
On slide |
In textbook |
| The eval and apply primitives |
On slide |
In textbook |
| The let* name binding construct |
On slide |
In textbook |
| The let name binding expression |
On slide |
In textbook |
| The letrec namebinding construct |
On slide |
In textbook |
| The alpha rewrite rule |
On slide |
In textbook |
| The append function |
On slide |
In textbook |
| The beta rewrite rule |
On slide |
In textbook |
| The capturing of continuations |
On slide |
In textbook |
| The catch and throw idea |
On slide |
In textbook |
| The equivalent meaning of let |
On slide |
In textbook |
| The eta rewrite rule |
On slide |
In textbook |
| The filtering function |
On slide |
In textbook |
| The function concept |
On slide |
In textbook |
| The function outline-copy |
On slide |
In textbook |
| The function simple-html-table |
On slide |
In textbook |
| The HTML mirrors in LAML |
On slide |
In textbook |
| The idea of currying |
On slide |
In textbook |
| The interpretation of self |
On slide |
In textbook |
| The intuition behind continuations |
On slide |
In textbook |
| The main programming paradigms |
On slide |
In textbook |
| The mapping function |
On slide |
In textbook |
| The ordering of reductions |
On slide |
In textbook |
| The read-eval-print loop |
On slide |
In textbook |
| The reduction functions |
On slide |
In textbook |
| The XHTML mirror in LAML |
On slide |
In textbook |
| The zipping function |
On slide |
In textbook |
| Theoretical results |
On slide |
In textbook |
| time elucidative program |
On slide |
In textbook |
| tools - in Lisp |
On slide |
In textbook |
| Tree processing (1) |
On slide |
In textbook |
| Tree processing (2) |
On slide |
In textbook |
| type |
On slide |
In textbook |
| Type checking |
On slide |
In textbook |
| type decoration |
On slide |
In textbook |
| type inference |
On slide |
In textbook |
| Types |
On slide |
In textbook |
| types - advantages of |
On slide |
In textbook |
| Types - in Haskell, ML, and Scheme |
On slide |
In textbook |
| Types in functional programming languages |
On slide |
In textbook |