diff options
| author | Krzysztof Gogolewski <krzysztof.gogolewski@tweag.io> | 2021-08-29 23:24:58 +0200 |
|---|---|---|
| committer | Andreas Klebinger <klebinger.andreas@gmx.at> | 2021-09-07 16:38:26 +0000 |
| commit | 46f27070e52c9069a94d5484da9b89bd2fedcaea (patch) | |
| tree | 640ff2864f0077c7210d91f432a8050fd2575284 /docs/users_guide/exts/quantified_constraints.rst | |
| parent | c7cc23b652c12f2cefabfc209732c8f70b69cc47 (diff) | |
| download | haskell-wip/doc-fixes.tar.gz | |
Documentation: use https linkswip/doc-fixes
Diffstat (limited to 'docs/users_guide/exts/quantified_constraints.rst')
| -rw-r--r-- | docs/users_guide/exts/quantified_constraints.rst | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/docs/users_guide/exts/quantified_constraints.rst b/docs/users_guide/exts/quantified_constraints.rst index 2ed53b6c4a..3b5b92a7b6 100644 --- a/docs/users_guide/exts/quantified_constraints.rst +++ b/docs/users_guide/exts/quantified_constraints.rst @@ -134,13 +134,13 @@ Notes: See `Iceland Jack's summary <https://gitlab.haskell.org/ghc/ghc/issues/14733#note_148352>`_. The key point is that the bit to the right of the ``=>`` may be headed by a type *variable* (``c`` in this case), rather than a class. It should not be one of the forall'd variables, though. - (NB: this goes beyond what is described in `the paper <http://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_, but does not seem to introduce any new technical difficulties.) + (NB: this goes beyond what is described in `the paper <https://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_, but does not seem to introduce any new technical difficulties.) Typing changes ---------------- -See `the paper <http://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_. +See `the paper <https://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_. Superclasses ---------------- @@ -152,7 +152,7 @@ Suppose we have:: From the ``x==x`` we need an ``Eq (m Int)`` constraint, but the context only gives us a way to figure out ``Ord (m a)`` constraints. But from the given constraint ``forall a. Ord a => Ord (m a)`` we derive a second given constraint ``forall a. Ord a => Eq (m a)``, and from that we can readily solve ``Eq (m Int)``. This process is very similar to the way that superclasses already work: given an ``Ord a`` constraint we derive a second given ``Eq a`` constraint. -NB: This treatment of superclasses goes beyond `the paper <http://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_, but is specifically desired by users. +NB: This treatment of superclasses goes beyond `the paper <https://i.cs.hku.hk/~bruno//papers/hs2017.pdf>`_, but is specifically desired by users. Overlap ------------- |