prefix binary operations → curry-able functions

Using an operator's prefix notation is unintuitive and prone to errors:

Just 3 |> Maybe.map ((-) 3)
--> Just 0

Proposal: remove (symbol) syntax and prefix binary operations in favor of actual functions:

• (^) n exp → n |> toPower exp
• (/) n div → n |> divideBy div
• (//) n div → n |> Int.divideBy div
• (*) n mul → n |> multiplyBy mul
• (-) n sub → n |> subtract sub
• (+) a b → b |> add a
• ...
• (||) a b → a |> and b
• (&&) bool other → bool |> or other
• min a b → a |> atMost b
• max a b → a |> atLeast b
• (<) a b → a |> isBelow b
• (<=) a b → a |> isAtMost b
• (>=) a b → a |> isAtLeast b
• (>) a b → a |> isAbove b
• (++) init tail, .append init tail → init |> .append tail
• (::) element list → list |> cons element
• (<|) → remove? apply?
• (|>) → remove? eat/feed/feedWith/with?
• (>>) → remove?
• (<<) → remove? over/overTo/to/then/thenTo/compose/furthermore/furtherTo?

including parser operators (replaced by |> skip, |> grab, ...).

My secret hope is that just like %, which was removed in favor of modBy & remainderBy,
conventions will develop abandoning, for example

• &&, ||, min, max, unary -, ^, all parser operators
• init ++ (middle |> operation) ++ tail
  • in favor of init |> append (middle |> operation) |> append tail and sometimes [ init, middle |> operation, tail ] |> concat

(I'm not opposed to removing all listed and more)

The issue does not name files, tests, or entry points. Start by surveying the compiler's parser and operator handling, then clarify which operators and replacement functions are in scope with maintainers. Done would require an agreed migration scope and corresponding compiler behavior, including parser operators.