[Agda] Weird termination problem

[Thorsten Altenkirch]

Hi,

I just transferred some code form my lecture notes to my book draft and now the termination checker complains where there was no problem before:

thm : {P : Form} → ([] ⊢ P) ⇔ ⊢sk P
proj₁ thm d = skC→sk (⊢→⊢skC d)
proj₂ thm SS = S-d
proj₂ thm KK = K-d
proj₂ thm (app d e) = app (proj₂ thm d) (proj₂ thm e)

so here ⊢sk P is inductively defined and there should be no problem – and indeed there wasn’t before. But now

Termination checking failed for the following functions:
  thm
Problematic calls:
  proj₂ thm e

I can’t make any sense out of it. Has anybody an inkling what could have happened or any advice what I could do to fix it.

I can prove the <= direction on its own with no problems. The definition of ⇔ is exactly the same as before and it doesn’t help if I expand it. Also the definition of products is the same as before.

If you want to have a look at the code please let me know – I will give you access to the repo.

Cheers,
Thorsten



This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please contact the sender and delete the email and
attachment. 

Any views or opinions expressed by the author of this email do not
necessarily reflect the views of the University of Nottingham. Email
communications with the University of Nottingham may be monitored 
where permitted by law.




-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.chalmers.se/pipermail/agda/attachments/20200815/64a19206/attachment.html>