diff options
author | ARATA Mizuki <minorinoki@gmail.com> | 2021-09-07 19:13:23 +0900 |
---|---|---|
committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2021-09-07 12:24:49 -0400 |
commit | 6ea9b3ee4454b87ecc017d89f131a80f57ef65aa (patch) | |
tree | 9c943959bc2c439571682915efb681df238547a6 | |
parent | 7fa8c32c107ee28676bd17a7f0fc797a87502779 (diff) | |
download | haskell-6ea9b3ee4454b87ecc017d89f131a80f57ef65aa.tar.gz |
Fix code example in the documentation of subsumption
-rw-r--r-- | docs/users_guide/exts/rank_polymorphism.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/users_guide/exts/rank_polymorphism.rst b/docs/users_guide/exts/rank_polymorphism.rst index 75ce0a06f9..b4d76812e6 100644 --- a/docs/users_guide/exts/rank_polymorphism.rst +++ b/docs/users_guide/exts/rank_polymorphism.rst @@ -168,7 +168,7 @@ Suppose: :: g1 :: forall x y. Int -> y -> x -> x f2 :: (forall a. (Eq a, Show a) => a -> a) -> Bool - g2 :: forall x. (Show x, Eq x) => Int -> a -> b -> b + g2 :: forall x. (Show x, Eq x) => x -> x then ``f1 g1`` and ``f2 g2`` are both well typed, despite the different order of type variables and constraints. What happens is that the |