Closed thomas-lamiaux closed 4 months ago
The tutorial is now ready to be reviewed. It :
The comment's are good and I'll look into them. An issue I have is that I lack simple examples. Would you have some to share @MevenBertrand ? In particular, would you have a good example for
using the database [WellFounded], possibly in combination with Derive to obtain the subterm relation
Also the issue with ack in 1.2 is that it is supposed to be basic and yet it doesn't work as you would expect. Though to make it clearer I can move it to a section 3.
For your first question: maybe you can show how to do last
a second time, but using subterm as the order rather lt
+ length
? Otherwise, I don't have an example on the top of my head, but I will think about one.
Re: ack
, I understand your issue, and I'm annoyingly not sure how to make it more readable (apart from having fixes merged upstream in Equations, it seems Matthieu is on it?). Maybe the solution would be again to have an alternative example which Equations does not choke on? (Again, I don't have one right now, but I can think about it.)
@MevenBertrand could you review the file tutorial about obligations and tell me if it is looks good to you ? Btw, I could also use help for the 2.2 part
Ready to be reviewed again
@MevenBertrand could you review the last commit. If all is good for you I'll merge. Btw if you hadn't noticed there is now automatic type checking and deployment.
A tutorial explaining how to use Equations to define functions by well-founded recursion, and how to reason about such functions.
There is left to :
Find a good examples for subterm relation, section 2.1