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 | |
Results tagged with agda
Search options not deleted
user 78
For questions regarding Agda: the programming language / proof assistant.
5
votes
1
answer
189
views
Application of `SSet` in Agda
Is there any presentable work that makes essential use of SSet in Agda? I kind of get the theory, but I'm not sure about the practical value of this. The documentation is currently not very helpful. …
- 4,334
3
votes
Using induction to define Indexed family of HITs in agda
Warning: This is called an indexed inductive family, and cubical Agda still has some unimplemented functionalities about this feature yet. …
- 4,334
2
votes
Accepted
Agda: Cannot Instantiate Metavariable
In usual cases Agda should infer that by looking at the types on both sides of the equality. … The further complication of transp completely threw Agda off, so it is reporting something seemingly unrelated to the core error. …
- 4,334
4
votes
Turning off some sProp checks
AFAIK there is no way to turn it off. It is also worth pointing out that the cost is greater than you expected.
data A : Prop where
a b : A
It is possible to prove eq : (B : Set)(f : A → B) → f a ≡ …
- 4,334
5
votes
Accepted
Defining coercion for proof irrelevant equality
Agda has a runtime irrelevance modality which may be closer to what you want. …
- 4,334