[Agda] Questions about unification

[András Kovács]

Ok, I agree that we can prune the LHS the way you described. What confused
me is that you seemed to imply that this may replace usual RHS pruning.

2016-11-28 10:21 GMT+01:00 Roman <effectfully at gmail.com>:

> András, it's been a while since I studied HOU, so I might forget some
> things, especially terminology. However this equation
>
>     U [x, y, w, w] =?= App (Var x) (Var w)
>
> can be transformed into (assuming the type of `w` doesn't depend on `y`)
>
>     U [x, _, w, w] := V [x, w, w]
>     V [x, w, w] =?= App (Var x) (Var w)
>
> And if you have a flexFlex case like in Ulf's example, then I don't
> see why you can't prune unused variables on both sides of the
> equation.
> _______________________________________________
> Agda mailing list
> Agda at lists.chalmers.se
> https://lists.chalmers.se/mailman/listinfo/agda
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.chalmers.se/pipermail/agda/attachments/20161128/4cb3999e/attachment.html