Navigate to list of lectures -- Keyboard shortcut: 'u'  Previous lecture -- Keyboard shortcut: 'p'  Next lecture -- Keyboard shortcut: 'n'  Course home        Alphabetic index  Exit possible frame set        First slide  First annotated slide  Lecture notes - all slides and notes together  Textbook of this lecture      PDF print page        Help page about these notes
Lecture 3

Name binding, Recursion, Iteration, and Continuations

Kurt NÝrmark
Department of Computer Science, Aalborg University, Denmark

Title page            Abstract            Audio lecture from the start            References from this lecture            Exercises in this lecture            Source programs in this lecture            

Total playing time of audio lecture: 1 hour, 28 minutes, 45 seconds

Page 1Name binding constructsPage 22Examples of recursion: string-merge
Page 2The let name binding expressionPage 23Examples with recursion: string-of-char-list?
Page 3The equivalent meaning of letPage 24Exercises
Page 4Examples with let name bindingPage 25Example of recursion: Hilbert Curves
Page 5The let* name binding constructPage 26Hilbert Curves
Page 6An example with let*Page 27Building Hilbert Curves of order 1
Page 7The letrec namebinding constructPage 28Building Hilbert Curves of order 2
Page 8LAML time functionsPage 29Building Hilbert Curves of order 3
Page 9Conditional expressionsPage 30Building Hilbert Curves of order 4
Page 10Conditional expressionsPage 31A program making Hilbert Curves
Page 11Examples with ifPage 32Continuations
Page 12Example with cond: leap-year?Page 33Introduction and motivation
Page 13Example with cond: american-timePage 34The catch and throw idea
Page 14Example with cond: as-stringPage 35A catch and throw example
Page 15Recursion and iterationPage 36The intuition behind continuations
Page 16RecursionPage 37Being more precise
Page 17List processingPage 38The capturing of continuations
Page 18Tree processing (1)Page 39Capturing, storing, and applying continuations
Page 19Tree processing (2)Page 40Use of continuations for escaping purposes
Page 20Recursion versus iterationPage 41Practical example: Length of an improper list
Page 21Example of recursion: number-intervalPage 42Practical example: Searching a binary tree

Internal 'show-and-speak' overview

LENO - LEcture NOtes with LAML technologyGenerated: Tuesday July 2, 2013, 09:15:04
Program Oriented Web Engineering - using LAML