Lecture 11
Difference Lists

Sample code to illustrate difference lists and similar incomplete
structures as a Prolog programming technique.

diff.pl -- queues, reverse, quicksort
           run this code through your type checker!

meta.pl -- depth-first meta-interpreter (solve/4) and
           breadth-first theorem prover (prove/4)
examples.pl -- examples for meta-interpreter and solver

reify.pl -- reification, in support of meta.pl
unif.pl -- unification, in support of meta.pl

Peg solitaire to illustrate state management

solitaire1.pl -- using unary natural numbers
solitaire2.pl -- using built-in integers (fastest, but still too slow)
solitaire3.pl -- written by committee in class