ICFPC2011-Monads

Home > ICFPC2011-Monads

ICFPC2011-Monads is a project mainly written in Haskell, it's free.

Second code variant using monad State, monad transformer and special data types (incomplete)

Code for ICFPC 2011 "Lambda: The Gathering".

Monads version with monad State and monad transformer. To unify cards-functions there are special data types.

Just for fun.

Done: cards-functions (fI, fK, fGet, etc.) Undone: all other things :)

function showing ("S(zero)(K(S(get)(I)))..."). This is a big problem because Function is recurcive data type having function in.
partial applying when function's arguments are undefined.
...

Author: Granin Alexandr [email protected] License: GNU GPLv3

Previous：first_app