I have finished a first draft of an overview on declarative programming. The section on functional programming is almost identical to the version published previously but I have added a section on logic programming features: unbound variables, non-determinism, search, and constraints.
The LP section contains a surprisingly concise solution for the n-queens problem and a lazy implementation of breadth-first search with a circular queue.
If you find time to read it, I’d be interested in whether you could follow easily or—if not—where you got stuck (especially if you are not very familiar with functional and/or logic programming).
