Agda
Agda is a dependently typed programming language / interactive theorem prover. (by agda)
agda2lagda
Simple conversion from Agda text to literate Agda text. (by andreasabel)
Our great sponsors
| Agda | agda2lagda | |
|---|---|---|
| 9 | 0 | |
| 1,816 | 12 | |
| 2.0% | - | |
| 9.6 | 5.5 | |
| 6 days ago | 15 days ago | |
| Haskell | Haskell | |
| LicenseRef-OtherLicense | LicenseRef-PublicDomain |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
Agda
Posts with mentions or reviews of Agda.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-05-15.
-
I solved collatz, but I have no idea how to write a paper.
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
Some programming languages are, https://github.com/agda/agda
-
Today, Thanks to this sub Reddit. I discovered 3 awesome new languages....
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?
- Integer overflow causes Russel's paradox
-
What input method would you prefer for Unicode characters in a neovim plugin?
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
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
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.
-
Road to 1.0/ Zig
Significant nit: this isn't true. The whole domain of "high-assurance software" is about this, with examples such as CompCert and seL4. There are tools like Frama-C that support you in proving things about your C; [proof assistants]() that let you extract Haskell, OCaml, or Scheme from proofs so the code is correct by construction; and languages like CakeML, F*, Agda, Idris, ATS... that are both programming languages and proof assistants.
agda2lagda
Posts with mentions or reviews of agda2lagda.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning agda2lagda yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing Agda and agda2lagda you can also consider the following projects:
lean - Lean Theorem Prover
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
open-typerep - Open type representations and dynamic types
distributive - Dual Traversable
agda-vim - Agda interaction in vim
miso - :ramen: A tasty Haskell front-end framework
agda-snippets - Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.
decidable - Combinators for manipulating dependently-typed predicates.
permutation - git import of patrick perry permutations lib from darcs
eliminators - Dependently typed elimination functions using singletons
fgl - A Functional Graph Library for Haskell