Question

write the shortest ML function you can that would not work correctly if implemented using statically allocated activation records. explain why it would fail. (hint: try to think ld a recursive function such that the calling activation's x is needed after recursice call)

write the shortest ML function you can that wouls not work correctly if implemented using a dynamically allocated stack kf activation records plus nesting link. why it would fail. (hint: think of function has degree three with two anonymous functions as arguments)

Answer 1

1)

fun x 1 = 1

|   x n = x (n - 1);

---

all the best

please upvote

2)

fun f x =

  let

    fun g y = x + y

  in

    g

  end;

Fails since a dynamically allocated stack of activation records plus nesting links will not accommodate the return value of a function which requires the use of values from the containing function.