Idris2/libs
Jan de Muijnck-Hughes 5774a9c6ae If we know the types of a & b start searching.
This is helpful when defining auto-implicits of the form:

    pairEqF : DecEq a
           => (thisX, x, y : a)
           -> {prfRefl : Equal x thisX}
           -> (prfEq   : decEq x thisX = Yes prfRefl)
           => Pair a a
    pairEqF thisX x y {prfRefl} {prfEq} = MkPair x y

before auto-implicit search would fail to find `Refl` for `prfRefl`.
With this fix the solution is found.

This fix means we can avoid having to write the following.

    pairEqF' : DecEq a
            => (thisX, x, y : a)
            -> (prfEq   : decEq x thisX = Yes (the (Equal x x) Refl))
            => Pair a a
    pairEqF' thisX x y {prfEq} = MkPair x y
2020-07-10 21:00:38 +01:00
..
base Added take to Vect. 2020-07-10 21:00:38 +01:00
contrib Simplify Equality 2020-07-07 10:48:23 +01:00
network Add linear network API 2020-06-25 12:07:33 +01:00
prelude If we know the types of a & b start searching. 2020-07-10 21:00:38 +01:00