A programmer is having difficulty debugging the following C program. In theory, on an "ideal" machine with infinite memory, this program would run forever. (In practice, this program crashes because it runs out of memory, as extra space is required every time a function call is made.) int f(int (*g)()){ /* g points to a function that returns an int */ return g(g); }

int main(){ int x; x = f(f); printf("Value ofx=%d ", x); return 0; }

Explain the behavior of the program by translating the definition of f into lambda calculus and then reducing the application f(f). This program assumes that the type checker does not check the types of arguments to functions.