<div dir="ltr"><div>Hi Peter<br></div>Thank you! <br><div class="gmail_extra"><br><br><div class="gmail_quote">On Sun, Mar 24, 2013 at 3:22 PM, Peter Hancock <span dir="ltr"><<a href="mailto:hancock@spamcop.net" target="_blank">hancock@spamcop.net</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
data List# ( A : Set ) : ℕ → Set where<br>
[] : List# A 0<br>
_:::_ : ∀ { n } → A → List# A n → List# A (n ⊹ 1)<br>
</blockquote>
<br></div>
Try replacing the last line with<br>
<br>
_:::_ : ∀ { n } → A → List# A n → List# A (suc n)<br>
<br>
I am not sure what Agda thinks "1" is, or whether (+1) is<br>
definitionally equal to suc. (The way you have defined it.<br>
(1+) is definitionally equal to suc, I think.)<br>
<br>
<br>
Basically, you have to learn how to interpret the error messages<br>
Agda gives you, which gets easier but can still be hard. Try to imagine what<br>
is going on in type-checking, perhaps by doing it carefully on<br>
paper. The messages should begin to make more sense.<br>
Constraints of definitional equality are being synthesised and checked.<br></blockquote><div><br></div><div>I will keep this in mind. <br> <br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<br>
<br>
All the best,<br>
Peter Hancock<div class="HOEnZb"><div class="h5"><br>
<br>
______________________________<u></u>_________________<br>
Agda mailing list<br>
<a href="mailto:Agda@lists.chalmers.se" target="_blank">Agda@lists.chalmers.se</a><br>
<a href="https://lists.chalmers.se/mailman/listinfo/agda" target="_blank">https://lists.chalmers.se/<u></u>mailman/listinfo/agda</a><br>
</div></div></blockquote></div><br></div></div>