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.
6
votes
Accepted
How to access local definitions in Agda
You can refer to local definitions if the where block is declared as a module:
sucℤIso = iso sucℤ predℤ s r module Mod where
s : section sucℤ predℤ
s (pos zero) = refl
s (pos (suc n)) = refl
s …
9
votes
Accepted
Is it possible to define `fib` coinductive stream w/o sized types?
It's a good general approach to try to figure out the state that has to remembered and updated on each unfolding, when we try to convert complicated coinduction to versions that are more palatable to Agda …
17
votes
Accepted
Constructive proof of strong normalization for simply typed lambda calculus
In Agda:
data SN {Γ A} (t : Tm Γ A) : Set where
sn : (∀ {t'} → t ~> t' → SN t') → SN t
Note that if a term is normal then it has no one-step reduct so SN t holds vacuously. … You could also look at my Agda formalization of Girard's Chapter 6, which uses this SN. …
23
votes
Accepted
What are the complex induction patterns supported by Agda?
What's in Agda
It's a fun exercise to try to summarize this in one phrase. … This is relevant in Coq but not in Agda). …
11
votes
What are the upsides and downsides of typed vs untyped conversion?
For example, Agda has typed conversion, but it still uses syntax-directed expansion for records because of performance concerns. …