anchor.diff:              e |> transformExpression (Environment.New(thisArg, false, isPure, args))
           | Choice2Of2 p ->
               p
  -            |> List.map (function S.Action a -> a | _ -> failwith "TODO: function declarations in Inline" )
  +            |> List.map (function S.Action a -> a | _ -> failwith "Currently unsupported: function declarations in Inline" )
               |> S.Block
               |> transformStatement (Environment.New(thisArg, false, isPure, args))
               |> IgnoredStatementExpr
  
positive.code:         )
      | S.If (a, b, c) -> If (trE a, trS b, trS c)
      | S.Ignore a -> ExprStatement (trE a)    
      | S.Labelled (a, b)  -> failwith "TODO: recognize labels"
      | S.Return a -> Return (match a with Some v -> trE v | _ -> Undefined)
      | S.Switch (a, b)    -> failwith "TODO: recognize switch"
      | S.Throw a -> Throw (trE a)
      | S.TryFinally (a, b) -> TryFinally (trS a, trS b)
      | S.TryWith (a, b, c, d)   -> failwith "TODO: recognize try-with"
      | S.Vars a ->
          match a with
          | [var, value] -> 
  
negative.code:         | SB.``<<``     -> Binary(trE a, BinaryOperator.``<<``, trE c)
          | SB.``<<=``    -> mbin a MutatingBinaryOperator.``<<=`` c
          | SB.``<=``     -> Binary(trE a, BinaryOperator.``<=``, trE c)
          | SB.``=``      -> setValue env (trE a) (trE c)
          | SB.``==``     -> Binary(trE a, BinaryOperator.``==``, trE c)
          | SB.``===``    -> Binary(trE a, BinaryOperator.``===``, trE c)
          | SB.``>``      -> Binary(trE a, BinaryOperator.``>``, trE c)
  