One reason might be for parsing efficiency.
In (n -> n + 1), it’s not clear it’s a function until ->, at which point the parser needs to back-track to the open parentheses and re-parse it as arguments to a lambda expression and a lambda body, rather than as a “normal” expression.
In (\n -> n +), it’s clear from the \ that the following should be parsed as arguments to a lambda, so no back-tracking is required, which can be expensive.