Basic implementation of General Problem Solver algorithm.

Basic implementation of General Problem Solver algorithm. Untested, does not fix many problems. The algorithm is abstract: you can provide your own type of goals and operations.

Basic implementation of General Problem Solver algorithm

Key features:

• Written in Haskell in less than 50 LOC.
• Abstract. You can have different types for operations and goals.

Warning:

• It is not tested.
• It does not fix problems like clobbered sibling problem, or recursive subgoal problem, etc.