Last week, I have successfully defended my thesis by giving a talk, answering questions during a disputation, and passing an examination. If you understand German, you may try to read my handwritten notes that I have prepared prior to the talk. Apart from my thesis and adjacent topics, the examination covered algebras for combinatorial search and free algebraic structures (see german lecture notes).
I have submitted my dissertation On Functional Logic Programming and its Application to Testing.
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.
The most important changes are:
- a simplified implementation of iterative deepening depth-first search and
- an additional section with experimental results.
There is also an extended one page abstract summarising the work.