Add a first implementation of an FMA node

* Add a node 'FusedMultiplyAdd' to loopy.symbolic
* Implement handlers all over the place
* In textual language, have a function fma(a,b,c) which is translated to the node
* Throw away the node in favor of sum/product in ExpressionToCExpressionMapper

Not yet implemented (only as a dummy): type inference