Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions regarding Agda: the programming language / proof assistant.
7
votes
1
answer
568
views
Examples of theories where tactic language is required for simple proofs
After that, I found out that the Agda "variant" of SF exists, and I do not have any such issues with it. … Almost all proofs seem clear to me at first sight, at least once you understand Agda syntax and the math idea behind proof. …