[Agda] Questions about unification

[Andreas Abel]

Indeed, Agda does prune on both sides, I implemented this 5 years ago.

On 28.11.2016 10:21, Roman wrote:
> 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
>


-- 
Andreas Abel  <><      Du bist der geliebte Mensch.

Department of Computer Science and Engineering
Chalmers and Gothenburg University, Sweden

andreas.abel at gu.se
http://www2.tcs.ifi.lmu.de/~abel/