Kurt Nørmark
Department of Computer Science, Aalborg University, Denmark
Abstract Previous lecture Index References Contents | Although we use Scheme for functional programming, Scheme can be used for imperative programming as well. In this side track we will take a look at this aspect of the language. |
Imperative Scheme constructs |
Imperative Scheme Constructs Slide Annotated slide Contents Index References Textbook |
|
|
|
|
List mutators Slide Annotated slide Contents Index References Textbook |
|
|
If we make use of list mutators we can tell the difference between a list structure, LS, and a copy of LS. The way to do it is to mutate LS and observe that the copy is not changed. Using only the functional subset of Scheme (and disregarding the very discriminating equality predicates such as eq? and eqv?) a copy of LS serves the same purposes as LS itself. |
|
String mutators Slide Annotated slide Contents Index References Textbook |
|
|
|
|
Imperative features in LAML |
Imperative features in LAML Slide Annotated slide Contents Index References Textbook |
|
|
|
|
Chapter 9: Imperative programming in Scheme
Course home Author home About producing this web Previous lecture (top) Next lecture (top) Previous lecture (bund) Next lecture (bund)
Generated: July 2, 2013, 09:16:16