The functional paradigm of the Wolfram Language used in Mathematica is all around wonderful.
For intense numerics, Mathematica comes with the ability to Compile sections of code to the Wolfram Virtual Machine (WVM). When written correctly, this can lead to speed boosts by orders of magnitude (I am particularly proud of the code in this question that computes the Dilogarithm). Also, it is totally portable, which makes it particularly useful to include in packages for public use.
But, for extremely long and complex algorithms, it is agonizingly clumsy to write the procedural code in Mathematica's functional syntax. Especially bad is if there are lots of nested If statements, and multiple subroutines that tend to require CompilationOptions -> {"InlineExternalDefinitions" -> True}. All the [[ [ [ [[ and ]] ] ] ]] drive me totally crazy.
Is there a way to write code that is closer in syntax to C that can also compile to WVM to preserve the overall portability?
Whichis compilable, and really helps cut down on nestedIfstatements. – QuantumDot Dec 01 '15 at 15:00