Is it possible to write recursive anonymous functions in SML? I know I could just use the `fun` syntax, but I'm curious.

I have written, as an example of what I want:

```
val fact =
    fn n => case n of
                 0 => 1
               | x => x * fact (n - 1)

```