Navigate to list of lectures -- Keyboard shortcut: 'u'  Previous lecture -- Keyboard shortcut: 'p'    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 4

LECTURE 4:
Evaluation Order and Infinite Lists

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 1Referential TransparencyPage 15An example of normal versus applicative evaluation
Page 2Referential transparencyPage 16Theoretical results
Page 3An illustration of referential transparencyPage 17Practical implications
Page 4Introduction to Evaluation OrderPage 18Conditionals and sequential boolean operators
Page 5Arbitrary evaluation order - with some limitsPage 19Lazy evaluation
Page 6Infinite evaluations and error evaluationsPage 20Delayed evaluation and infinite lists in Scheme
Page 7Infinite evaluations and error evaluations - clarificationPage 21Delayed evaluation in Scheme
Page 8Rewrite rules, reduction, and normal formsPage 22Examples of delayed evaluation
Page 9Rewrite rulesPage 23Infinite lists in Scheme: Streams
Page 10The alpha rewrite rulePage 24Example streams
Page 11The beta rewrite rulePage 25Stream example: The Sieve of Eratosthenes
Page 12The eta rewrite rulePage 26Applications of The sieve of Eratosthenes
Page 13Normal formsPage 27Exercises
Page 14The ordering of reductions

LENO - LEcture NOtes with LAML technologyGenerated: Tuesday October 3, 2017, 15:47:58
Program Oriented Web Engineering - using LAML