Postscript versions of the lecture notes (Greiner)

• Introduction
• Introduction   [4ps]
• Paradigms  [4ps]
• Functional Programming
• Foundations
• Functions  [4ps]
• Lisp Foundations
• Overview, DataStructure (Sexpressions), Built-in Functions and Predicates  [4ps]
• Evaluation (forms)  [4ps]
• Lambda-Expressions  [4ps]
• Special Forms (cond, and, or, ...)  [4ps]
• Functional arguments + Label  [4ps]
• Issues
• Recursion, Variables, Efficiency  [4ps]
• FunargProblem (scoping, mapping fns)  [4ps]
• Program=data: eval, nlambda, apply, OOp  [4ps]
• "Extensions" to Lisp
• SideEffects  [4ps]
• Numbers, DottedPair, ALists, PLists  [4ps]
• Other Functions (i/o, do, ...)  [4ps]
• Example
• Polynomial  [4ps]
• Theoretical Foundations  (See also Szafron notes)
•  Intro to Lambda Calculus [4ps]
• Application of Lambda Calculus [4ps]
• AbstractLanguage+HigherOrderFunctions   [4ps]
• Self-Interpretation  [4ps]
• Contexts+Closures [4ps]
• SECD Machine  [4ps]  (html)
• Declarative Programming
• Motivation (Expert Systems)  [4ps] [pdf] [ppt]
• Mechanics of Prolog
  • Terms, Substitution, Unification/MGU, Horn Clauses, Proof process / examples   [4ps]   [pdf]
  • Example: List Processing [4ps] [pdf]
• Theoretical Foundations
  • Semantics [4ps] [pdf] [ppt]
  • Resolution [4ps] [pdf]
• Prolog Itself
• Prolog's Stance [4ps] [pdf]
• Not covered (2004):
  • Operators (Not, Cut) [4ps] [pdf]
  • Tools (assert, retract, program=data, utilities) [4ps] [pdf]
• Meta Control (Efficiency) [4ps] [pdf]
• Constraint Satisfaction  [4ps] [pdf]
  Intro CLP (Mueller)
• Probabilistic Inference
  • Intro Belief Nets (ppt)
  • Probability 101 [4ps] [pdf]
  • Other information on Belief Nets   Alternative site

• NOT USED:
  "Integers" [4ps] [pdf]
  Auxiliary Material (Factoids, Goedel Incompleteness, Declarative/Procedural) [4ps] [pdf]