My question is in continuation to lambda calculus reduction: (((lambda f (lambda x (f x))) (lambda y (* y y))) 12)
given the input:
((((lambda f (lambda x ((f x) f))) (lambda y (lambda g (g (* y y))))) 2) (lambda a a))
I want to understand the order of reductions that I should take. in the above mentioned question it was suggested to me to apply left most reduction.
I want to check if this is a valid 1st step towards leftmost reduction:
Or should f= λy.λg.g(*y y) instead ? What it might boil down to is: am I allowed to solve the sub-trees up before applying the solution from the right subtree on the left sub-tree?