Re: [Haskell] Djinn and the inverse of a typechecker

oleg@pobox.com wrote:

In the following example we will be using a simplified (and perhaps, more elegant) system than the one used in the class. The typechecker uses only conjunctions and disjunctions. The evaluator of the logic system is complete: if there is a solution, the evaluator will always find it in finite time.

Is it also terminating? So if there is no solution it will tell you so. -- Lennart