This is a PHOAS encoded lambda calculus with as extension mu-binders (which behave like letrec). It has an applicative interface providing an easy way to express recursion in it. Idea came from: http://www.cs.utexas.edu/~wcook/Drafts/2012/graphs.pdf. I generalized it somewhat and provided a nicer interface.