Table of ContentsProgramming Languages ILISP LISP LISP (cont’d) LISP (cont’d) LISP (cont’d) LISP operations LISP operations (cont’d) Applying functions Anonymous functions Definitions Definitions (cont’d) Assignments Definitions vs. assignments Data types LISP programs Quiz Quiz (cont’d) Quiz (cont’d) List operations List operations (cont’d) List operations (cont’d) List operations (cont’d) List operations (cont’d) List operations (examples) Some shorthand Some useful predicates Some useful predicates (cont’d) Some useful predicates (cont’d) True and false Sample function Sample function (cont’d) List representation Examples Examples (cont’d) Examples (cont’d) Examples (cont’d) Examples (cont’d) List equality List equality (cont’d) Copying lists Copying lists (cont’d) An exercise: Flatten An exercise (cont’d) Append Reversing a list Reversing a list (cont’d) Reversing a list (cont’d) Reversing a list (cont’d) Reversing a list (cont’d) Side effects Side effects (cont’d) Side effects (cont’d) Side effects (cont’d) Side effects (cont’d) Quiz Quiz (cont’d) Associative Lists Associative lists (cont’d) Recursion Scheme Loop Scheme Loop (cont’d) Input/output Input/output (examples) Multiple actions More on recursion Function parameters Function parameters (cont’d) Higher order functions Higher order functions (cont’d) Higher order functions (cont’d) Higher order functions and lambda Another use for lambda |
Author: Computer Science Department |