|almost 9 years ago||3 days ago|
|BSD 3-clause "New" or "Revised" License||LicenseRef-OtherLicense|
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
We haven't tracked posts mentioning representable-functors yet.
Tracking mentions began in Dec 2020.
Do you feel static types have "won the war", so to speak?
4 projects | reddit.com/r/ExperiencedDevs | 13 Jun 2022
At the most extreme level, you disappear into a meditative solitary retreat for a couple of years to seek enlightenment, and when you emerge you're no longer a programmer who writes programs, you're a theorist who proves theorems in Agda, and you have transcended above things that are tainted by the inherent evil of the material plane like "side effects" and "business needs" and "delivery timelines" and "could you stop doing that fancy math crap and just change the button's color like I asked for".
Can I write Agda using only ASCII characters?
2 projects | reddit.com/r/agda | 29 May 2022
(For example, the standard dependent pair definition Σ, which is defined in Agda's core, does not have any).
I solved collatz, but I have no idea how to write a paper.
2 projects | reddit.com/r/Collatz | 15 May 2022
Learn how to use a formal proof assistant. Coq and Agda are the most popular. Both allow you to write a proof as a program instead of as a paper, and provide various tools for formally checking your proof.
Eli5, What is a proof assistant
1 project | reddit.com/r/explainlikeimfive | 19 Mar 2022
Some programming languages are, https://github.com/agda/agda
Today, Thanks to this sub Reddit. I discovered 3 awesome new languages....
5 projects | reddit.com/r/ProgrammingLanguages | 13 Feb 2022
If you're looking for stuff pushing the boundaries of PL research, Agda (especially Cubical Agda) might be cool to look at. It's got lots of cutting edge stuff in it, pushing the boundaries of what is currently possible with dependent type theory. It's not the only language out there with cubical features (see also: cooltt), but it's probably one of the more fleshed-out implementations in terms of being practically useful. The 1Lab makes heavy use of it. There's also Introduction to Univalent Foundations of Mathematics with Agda that might be interesting to look at too!
Ask HN: What technology is “cutting edge” in 2022?
7 projects | news.ycombinator.com | 23 Jan 2022
Integer overflow causes Russel's paradox
1 project | news.ycombinator.com | 22 Dec 2021
What input method would you prefer for Unicode characters in a neovim plugin?
7 projects | reddit.com/r/agda | 18 Oct 2021
My best guess is that it has not really been maintained lately, there were only 12 commits in the last 7 years, some of which are just global modifications, which include this file as well: https://github.com/agda/agda/commits/136f85386ec43245745b76f03505bda4f5d1ed3f/src/full/Agda/Interaction/Highlighting/Vim.hs
Type in type and HoTT exercises
1 project | reddit.com/r/agda | 28 Aug 2021
Also I would suggest is that you import a paradox (e.g., https://github.com/agda/agda/blob/master/test/Succeed/Hurkens.agda) and see what it actually does when you construct values with it that you evaluate or proofs that you use.
Trouble with Proving Termination without K
2 projects | reddit.com/r/agda | 20 Jan 2021
Andrea had some code relaxing these restrictions at the last AIM (cf. "trying to make termination checker accept more definitions --without-K, fixing #4527" in the wrap-up section) but I don't know if it has been merged into master yet.
What are some alternatives?
lean - Lean Theorem Prover
open-typerep - Open type representations and dynamic types
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
miso - :ramen: A tasty Haskell front-end framework
distributive - Dual Traversable
coq - Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
agda.nvim - NeoVim plugin for interacting with Agda written in Lua
fgl - A Functional Graph Library for Haskell
agda-vim - Agda interaction in vim
eliminators - Dependently typed elimination functions using singletons