Edwin Brady 8e9655dd9b Unbound implicits are invertible in terms ... Just like all other pi-bound things, if m is an unbound implicit and we have m ?x = m y as a unification problem, we can conclude ?x = y because it has to be true for all ms. This was implemented in Blodwen but I hadn't got around to it yet for Idris2... fortunately it's a bit easier in Idris2! Fixes #44		2019-07-26 12:27:54 +01:00
..
Dep.idr	Unbound implicits are invertible in terms	2019-07-26 12:27:54 +01:00
expected	Unbound implicits are invertible in terms	2019-07-26 12:27:54 +01:00
run	Unbound implicits are invertible in terms	2019-07-26 12:27:54 +01:00