# Problem $2$: Let it Go $(25$ points$)$

In this problem, we explore the concept of "referential transparency" in lettuce by showing that we can get rid of let bindings.

The main idea is to rewrite Lettuce programs to get rid of Let bindings systematically.

### Example $1$

~~~

let x $=15$ in

x $+$ x

~~~