CS218 and CS318: Higher-Order Logic Programming
Handouts for Spring 1996

• Structure and Outline of Course (Handout from first class).

• Using scoping devices to realize hiding effects.

• Higher-order syntax and scoping primitives: Illustration of their utility through the implementation of type inference.
  Note: Some parts of this handout were filled in by hand. The version here has gaps in these places. Will be corrected at some point. (Let me know if you would be willing to do this.)

• Sequent calculus for higher-order logic

• A defining criterion for logic programming and first-order extensions of Prolog (Horn clauses) based on this.

• Higher-order hereditary Harrop formulas: the basis for a higher-order logic programming language.

• Handouts for lectures on the lambdaProlog language and its uses