enricozb

// This file enumerates `Tree -> Tree` functions, where:
// data Tree = (C Tree Tree) | L

// It works by creating a superposed tree of all algorithms with a given
// pattern-match count. For example, for count=0, we create:
// λt (t
//   // case C:
//   λx λy
//     #0{
//       (C <var> <var>)