A programmer is having difficulty debugging the following C program. In theory, with infinite memory, this program would run forever but in practice, this program crashes because it runs out of memory.

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.

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 of x = %d ", x); return 0; 

}