Lecture overview -- Keyboard shortcut: 'u'  Previous page: Binding of free names -- Keyboard shortcut: 'p'  Next page: The <span>fluid-let</span> namebinding construct -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Help page about these notes  Alphabetic index  Course home  Lecture 1 - Page 44 : 49
Programming Paradigms
Introduction to Functional Programming in Scheme
Binding of free names - examples

We illustrate differences between static and dynamic binding of free names

c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/free-names-1.scmA function g with four free names a, b, c, and d.


c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/free-names-2.scmA function g with four free names a, b, c, and d - statically bound in an outer let in Scheme.


c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/free-names-3.scmA function g with four bounded names a, b, c, and d - passing many parameters from f to g.


Dynamic binding of free name provides for implicit passing of the formal parameters of f to g

In some situations, this is convenient: Temporary shadowing of more global name bindings

In other situations it may give surprises...