A bit more unicode.

blog/2024-06-17-automap.md

@@ -570,7 +570,7 @@ start-to-finish for each top-level definition in a program:
 3. The solution to the ILP tells the compiler how to insert the minimal number
    of `map`s and `rep`s to make the program rank-correct. For example, if `Mᵢ =
    3` and `Rᵢ = 0` for an application `f x`, then transform the application by
-   inserting three `map`s and no `rep`s: `f x |--> map (map (map f)) x`.
+   inserting three `map`s and no `rep`s: `f x ⟶ map (map (map f)) x`.
 
 4. Type check the transformed program with all implicit `map`s and `rep`s made
    explicit using Futhark's normal type checker and continue with compilation as