Consider the following SLang 1 program:
((fn(f,g)=>fn(x)=>(f (g x)) fn(p)=>add1(p) fn(q)=>*(q,4)) 6)
What does it return when evaluated?
It may help you to build a complete parse tree for this expression.
What is the behavior of the first (leftmost) anonymous function?