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

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, 52 minutes, 13 seconds

Page 1Show and speak slideName binding constructsPage 22Show and speak slideExamples of recursion: string-merge
Page 2Show and speak slideThe let name binding expressionPage 23Show and speak slideExamples with recursion: string-of-char-list?
Page 3Show and speak slideThe equivalent meaning of letPage 24Show and speak slideExercises
Page 4Show and speak slideExamples with let name bindingPage 25Show and speak slideExample of recursion: Hilbert Curves
Page 5Show and speak slideThe let* name binding constructPage 26Show and speak slideHilbert Curves
Page 6Show and speak slideAn example with let*Page 27Show and speak slideBuilding Hilbert Curves of order 1
Page 7Show and speak slideThe letrec namebinding constructPage 28Show and speak slideBuilding Hilbert Curves of order 2
Page 8Show and speak slideLAML time functionsPage 29Show and speak slideBuilding Hilbert Curves of order 3
Page 9Show and speak slideConditional expressionsPage 30Show and speak slideBuilding Hilbert Curves of order 4
Page 10Show and speak slideConditional expressionsPage 31Show and speak slideA program making Hilbert Curves
Page 11Show and speak slideExamples with ifPage 32Show and speak slideContinuations
Page 12Show and speak slideExample with cond: leap-year?Page 33Show and speak slideIntroduction and motivation
Page 13Show and speak slideExample with cond: american-timePage 34Show and speak slideThe catch and throw idea
Page 14Show and speak slideExample with cond: as-stringPage 35Show and speak slideA catch and throw example
Page 15Show and speak slideRecursion and iterationPage 36Show and speak slideThe intuition behind continuations
Page 16Show and speak slideRecursionPage 37Show and speak slideBeing more precise
Page 17Show and speak slideList processingPage 38Show and speak slideThe capturing of continuations
Page 18Show and speak slideTree processing (1)Page 39Show and speak slideCapturing, storing, and applying continuations
Page 19Show and speak slideTree processing (2)Page 40Show and speak slideUse of continuations for escaping purposes
Page 20Show and speak slideRecursion versus iterationPage 41Show and speak slidePractical example: Length of an improper list
Page 21Show and speak slideExample of recursion: number-intervalPage 42Show and speak slidePractical example: Searching a binary tree

Internal 'show-and-speak' overview

LENO - LEcture NOtes with LAML technologyGenerated: Wednesday July 7, 2010, 15:37:49
Program Oriented Web Engineering - using LAML