Lecture 1 - Page 21 : 49

Programming Paradigms Introduction to Functional Programming in Scheme * Lisp and Scheme Lisp Scheme R5RS, R6RS, R7RS, ... * Expressions and values The read-eval-print loop - REPL Practical Scheme Programming * Types Types Typing and Typecheck * Lists Proper lists Symbolic expressions and improper lists Practical list construction List functions Association lists Property lists Programs represented as lists * Other Data Types Other simple types Vectors Strings * Definitions Definitions * Functions The function concept Evaluation of parenthesized expressions in Scheme Lambda Expressions in Scheme Lambda calculus Function objects Functions as first class values Closures More forms of lambda expressions in Scheme Function definition in Scheme * Name binding constructs The let name binding expression The equivalent meaning of let The let* name binding construct The let* name binding construct An example with let* The letrec namebinding construct An implementation of letrec Binding of free names Binding of free names - examples The fluid-let namebinding construct * Referential Transparency Referential Transparency - Practical Aspects Referential Transparency More Excercises

The main differences between lists and vectors are the mode of access and the mode of construction

There is direct access to the elements of a vector. List elements are accessed by traversing a chain of references. This reflects the basic differences between arrays and linked lists. The mode of construction for list is recursive, using the cons function. Lists are created incrementally: New elements can be created when needed, and prepended to the list. Vectors are allocated in one chunck, and cannot be enlarged or decreased incrementally.

R5RS: Vectors Future exercise about binary search in vectors