We have a graph which has one output and several inputs. We want to curry it. For this we have to artificially give names to the inputs, i.e. to number them (notice that such a thing is not needed in graphic lambda).
The next step is to use a -zipper in order to clip the inputs, by using graphic beta moves, until we get this:
This graph is, in fact, the following one (we replace the -zipper, which is just a notation, or a macro, with its expression).
The graph inside the green dotted rectangle is the currying of , let’s call him . This graph has only one output and no inputs. (The procedure of currying can be made itself into a graph which is applied to the output of , but we stop at this level for this post.) The graph inside the red dotted rectangle is almost a list. We shall transform it into a list by using again a zipper and one graphic beta move.
Now we’re done!
As you see, the currying creates the list, or the list creates the currying, or both form a pair, like the homunculus and the scenic space , an allusion to my post on the Cartesian Theater.