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      PDF print page        Help page about these notes
Lecture 2

LECTURE 2:
Recursion and Higher-order Functions

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

Title page            Abstract            References from this lecture            Exercises in this lecture            Source programs in this lecture            

Page 1Recursion and IterationPage 19Classical higher-order functions: Overview
Page 2RecursionPage 20Mapping
Page 3Recursion versus iterationPage 21The mapping function
Page 4Tail CallsPage 22Examples of mapping
Page 5Example of recursion: number-intervalPage 23Filtering
Page 6Examples of recursion: string-mergePage 24The filtering function
Page 7Examples with recursion: string-of-char-list?Page 25Examples of filtering
Page 8ExercisesPage 26Reduction and Zipping
Page 9Recursion without define and letrecPage 27Reduction
Page 10The ChallengePage 28The reduction functions
Page 11Development of the Y-combinatorPage 29Accumulation
Page 12Introduction to higher-order functionsPage 30Zipping
Page 13Higher-order functionsPage 31The zipping function
Page 14Some simple and general higher-order functionsPage 32Currying
Page 15Linear search in listsPage 33The idea of currying
Page 16Generation of list selectorsPage 34Currying in Scheme
Page 17ApplyPage 35More Exercises
Page 18Mapping and Filtering

LENO - LEcture NOtes with LAML technologyGenerated: Tuesday September 19, 2017, 11:35:03
Program Oriented Web Engineering - using LAML