Is there an obvious way to confirm if a function is tail recursive?

Question

Is there a way to find out if a function from F # is tail recursive?

I tried to explain this, but some people seem to be struggling and asking if there is a way to confirm what they did, the tail is recursive. Is there anything easy that you can do (with the exception of trying) to confirm that the tail is revoked (or not) (preferably in the IDE)?

(I tried Reflector, but it just crashes on me when I open F # projects!)

Answer 1

From here (with a few examples in the article):

, ?

- . F # - , , , , MSIL Dissasembler (ildasm.exe). .