A continuation-based, backtracking, logic programming monad. An adaptation of the two-continuation implementation found in the paper Backtracking, Interleaving, and Terminating Monad Transformers available here: http://okmij.org/ Control.Monad.Logic.Class
Alkemy is a decision-tree learning system designed to learn comprehensible theories from structured data. The theoretical foundations for Alkemy is provided in the book `Logic for Learning' by John Lloyd. Alkemy is implemented in Noweb-C++, with fairly extensive documentation. It is being actively supported. The current version is Release 1.3. (Escher is now implemented.) The program and its source code is protected by copyright, but is available for research and educational purposes. If you wish to use this code in any other way, please contact me for more information. Kindly email a short note to let me know you have downloaded the system. Also let me know if you wish to be added to an Alkemy mailing list. The list will inform people of updates to the system. An older (but more efficient) version that does not make use of Escher for computation is available here.