Strategies +Control.Parallel -parallel
Defines a mechanism to add evaluation strategies to graph rewriting systems. Currently only leftmost-outermost reduction is implemented.
A Haskell implementation of the method of Chapter 6 of The Compleat Strategyst (J.D. Williams, McGraw-Hill 1955) for finding optimal mixed strategies for two-player hidden information games given a payoff matrix.