Andy Ross schrieb:
Curtis L. Olson wrote:
Finally, I get to realize my dream of re-implimenting all FG
algorithms using recursion.
Not to ruin the joke, but you could do that already. Nasal has always
been a fully functional language, with recursion, lexical closures and
anonymous lambda expressions. :)
We should recode FGFS functional then.
Then I can proofe that that I'll never crash a plane! :)
Flightgear-devel mailing list