Lecture overview -- Keyboard shortcut: 'u'  Previous page: An implementation of letrec -- Keyboard shortcut: 'p'  Next page: Binding of free names - examples -- Keyboard shortcut: 'n'  Lecture notes - all slides together  Annotated slide -- Keyboard shortcut: 't'  Alphabetic index  Help page about these notes  Course home    Introduction to Functional Programming in Scheme - slide 43 : 49

Binding of free names

Static or dynamic binding of free names in lambda expressions

A name n is free in some function F if n is applied, but not defined in F