You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current implementation of "with" by translation into an auxiliary function looses the connection
suc (suc n) < suc n
in the example
f : Nat -> Nat
f zero = zero
f (suc zero) = zero
f (suc (suc n)) with zero
... | m = f (suc n)
Hence, termination checking fails.
What version of Agda are you using? 2.2.7 (darcs, 2010-01-10)
On what operating system? Any
Maybe the relation of input "suc (suc n)" and recursive argument "suc n" could be recovered if one adds some dummy arguments to the generated auxiliary function.
Original issue reported on code.google.com by andreas....@gmail.com on 11 Jan 2010 at 9:56
The current implementation of "with" by translation into an auxiliary function looses the connection
in the example
Hence, termination checking fails.
What version of Agda are you using? 2.2.7 (darcs, 2010-01-10)
On what operating system? Any
Maybe the relation of input "suc (suc n)" and recursive argument "suc n" could be recovered if one adds some dummy arguments to the generated auxiliary function.
Original issue reported on code.google.com by
andreas....@gmail.com
on 11 Jan 2010 at 9:56Attachments:
The text was updated successfully, but these errors were encountered: