issues
search
jonsterling
/
agda-calf
A cost-aware logical framework, embedded in Agda.
https://jonsterling.github.io/agda-calf/
Apache License 2.0
55
stars
2
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Update to `agda-stdlib` v2.0
#52
HarrisonGrodin
closed
8 months ago
0
Example: Joinable Red Black Tree in Decalf
#51
runmingl
opened
1 year ago
0
Example: Treap data structure
#50
aricursion
opened
1 year ago
0
Fracture program inequality into extensional equality and cost bound
#49
HarrisonGrodin
opened
1 year ago
0
Add probabilistic reasoning
#48
HarrisonGrodin
closed
1 year ago
0
Add Decalf examples
#47
HarrisonGrodin
closed
1 year ago
0
Clean up core
#46
HarrisonGrodin
closed
1 year ago
0
remove scary equality rules?
#45
jonsterling
closed
1 year ago
0
Include results in bounds
#44
HarrisonGrodin
closed
1 year ago
1
Clean up type names
#43
HarrisonGrodin
closed
1 year ago
0
Make `meta` positive
#42
HarrisonGrodin
closed
1 year ago
0
Enable common flags in `.agda-lib` file
#41
HarrisonGrodin
closed
1 year ago
0
Remove `tbind` and `dbind`
#40
HarrisonGrodin
closed
1 year ago
0
Use Literate Agda?
#39
HarrisonGrodin
opened
1 year ago
2
Rename `&`?
#38
HarrisonGrodin
closed
1 year ago
0
Rename `step`?
#37
HarrisonGrodin
opened
1 year ago
2
Make `meta` positive
#36
HarrisonGrodin
closed
1 year ago
0
Specify `IsBounded` synthetically
#35
HarrisonGrodin
closed
1 year ago
0
Example: Joinable Red Black Tree
#34
runmingl
opened
1 year ago
0
Update `agda-stdlib` to nightly
#33
HarrisonGrodin
closed
1 year ago
0
Redo coinductive amortized analysis synthetically
#32
HarrisonGrodin
closed
1 year ago
0
Amortized analysis via coinduction
#31
HarrisonGrodin
closed
1 year ago
0
Improve BigO docs
#30
HarrisonGrodin
closed
3 years ago
0
Clean up Sorting
#29
HarrisonGrodin
closed
3 years ago
2
Document code
#28
HarrisonGrodin
closed
3 years ago
0
Add --without-K everywhere
#27
HarrisonGrodin
closed
1 year ago
5
Prove Big-O bounds
#26
HarrisonGrodin
closed
3 years ago
0
Move non-core files to `Types`
#25
HarrisonGrodin
closed
3 years ago
0
Clean up `ub`
#24
HarrisonGrodin
closed
3 years ago
3
Reorganize files pertaining to the phase distinction
#23
HarrisonGrodin
closed
3 years ago
9
Remove ub/bind/const'
#22
HarrisonGrodin
closed
3 years ago
0
Replace U (meta ℕ) with nat
#21
HarrisonGrodin
closed
3 years ago
4
Remove unused Nat auxiliary functions
#20
HarrisonGrodin
closed
3 years ago
0
Remove meta/step
#19
HarrisonGrodin
closed
3 years ago
0
Add more examples of cost monoids
#18
HarrisonGrodin
closed
1 year ago
1
Replace step' with step
#17
HarrisonGrodin
closed
3 years ago
0
Require _+_ be cancellative with respect to _≡_ instead of _≤_
#16
HarrisonGrodin
closed
3 years ago
0
Replace `q ≤ p` with `◯ (q ≤ p)` in `ub`
#15
HarrisonGrodin
closed
3 years ago
1
Fix Id example
#14
HarrisonGrodin
closed
3 years ago
0
Prove parallel cost bounds of Sorting
#13
HarrisonGrodin
closed
3 years ago
1
Add parallelism
#12
HarrisonGrodin
closed
3 years ago
1
Parameterize Calf library on an abstract cost monoid
#11
HarrisonGrodin
closed
3 years ago
0
[Do Not Merge] Split Sorting into multiple files
#10
HarrisonGrodin
closed
3 years ago
1
Clean up and reorganize files
#9
HarrisonGrodin
closed
3 years ago
0
Prove closed-form sorting bounds
#8
HarrisonGrodin
closed
3 years ago
3
Prove ◯(InsertionSort.sort ≡ MergeSort.sort)
#7
HarrisonGrodin
closed
3 years ago
0
Prove merge sort cost
#6
HarrisonGrodin
closed
3 years ago
0
Switch insertion sort to comparison cost model
#5
HarrisonGrodin
closed
3 years ago
0
Implement merge sort
#4
HarrisonGrodin
closed
3 years ago
3
Prove insertion sort cost
#3
HarrisonGrodin
closed
3 years ago
1
Next